CLASS XII

There will be two papers in the subject: half and full adders, majority circuit etc.,
Paper I: Theory……….. 3 hours….70 marks SOP and POS representation; Maxterms &
Minterms, Canonical and Cardinal
Paper II: Practical…….. 3 hours….30 marks
representation, reduction using Karnaugh
PAPER I –THEORY – 70 MARKS maps and Boolean algebra.
SECTION A 2. Computer Hardware
1. Boolean Algebra (a) Elementary logic gates (NOT, AND, OR,
(a) Propositional logic, well formed formulae, NAND, NOR, XOR, XNOR) and their use in
truth values and interpretation of well formed circuits.
formulae (wff), truth tables, satisfiable,
unsatisfiable and valid formulae. Equivalence (b) Applications of Boolean algebra and logic
gates to half adders, full adders, encoders,
laws and their use in simplifying wffs.
decoders, multiplexers, NAND, NOR as
Propositional variables; the common logical universal gates.
connectives (~ (not)(negation), ∧
(and)(conjunction), ∨ (or)(disjunction), ⇒ Show the correspondence between Boolean
(implication), ⇔ (biconditional); definition methods and the corresponding switching
of a well-formed formula (wff); circuits or gates. Show that NAND and NOR
`representation of simple word problems as gates are universal by converting some circuits
wff (this can be used for motivation); the to purely NAND or NOR gates.
values true and false; interpretation of a wff;
truth tables; satisfiable, unsatisfiable and SECTION B
valid formulae.
The programming element in the syllabus (Sections B
Equivalence laws: commutativity of ∧, ∨; and C) is aimed at algorithmic problem solving and
associativity of ∧, ∨; distributivity; De not merely rote learning of Java syntax. The Java
Morgan’s laws; law of implication (p ⇒ q ≡ version used should be 5.0 or later. For programming,
~p ∨ q); law of biconditional ((p ⇔ q) ≡ the students can use any text editor and the javac and
(p ⇒ q) ∧ (q ⇒ p)); identity (p ≡ p); law of java programs or any other development
negation (~ (~p) ≡ p); law of excluded environment: for example, BlueJ, Eclipse, NetBeans
middle (p ∨~p ≡ true); law of contradiction etc. BlueJ is strongly recommended for its simplicity,
(p∧~p ≡ false); tautology and contingency ease of use and because it is very well suited for an
simplification rules for ∧, ∨. Converse, ‘objects first’ approach.
inverse and contra positive. Chain rule,
3. Implementation of algorithms to solve
Modus ponens.
problems
(b) Binary valued quantities; basic postulates The students are required to do lab assignments
of Boolean algebra; operations AND, OR and in the computer lab concurrently with the
NOT; truth tables. lectures. Programming assignments should be
(c) Basic theorems of Boolean algebra done such that each major topic is covered in at
(e.g. duality, idempotence, commutativity, least one assignment. Assignment problems
associativity, distributivity, operations with 0 should be designed so that they are sufficiently
and 1, complements, absorption, involution); challenging. Students must do algorithm design,
De Morgan’s theorem and its applications; address correctness issues, implement and
execute the algorithm in Java and debug where
reducing Boolean expressions to sum of
necessary.
products and product of sums forms;
Karnaugh maps (up to four variables). Self explanatory.
Verify the laws of Boolean algebra using
truth tables. Inputs, outputs for circuits like

6
4. Programming in Java (Review of Class XI methods (number problems, finding roots of
Sections B and C) algebraic equations etc.).
Note that items 4 to 13 should be introduced 10. Arrays, Strings
almost simultaneously along with classes and
Structured data types – arrays (single and multi-
their definitions.
dimensional), address calculations, strings.
While reviewing, ensure that new higher order Example algorithms that use structured data types
problems are solved using these constructs. (e.g. searching, finding maximum/minimum,
sorting techniques, solving systems of linear
5. Objects
equations, substring, concatenation, length,
(a) Objects as data (attributes) + behaviour access to char in string, etc.).
(methods); object as an instance of a class.
Storing many data elements of the same type
Constructors.
requires structured data types – like arrays.
(b) Analysis of some real-world programming Access in arrays is constant time and does not
examples in terms of objects and classes. depend on the number of elements. Address
calculation (row major and column major),
(c) Basic input/output using Scanner and Printer
Sorting techniques (bubble, selection, insertion).
classes from JDK; input/output exceptions.
Structured data types can be defined by classes –
Tokens in an input stream, concept of
String. Introduce the Java library String class
whitespace, extracting tokens from an input
and the basic operations on strings (accessing
stream (String Tokenizer class).
individual characters, various substring
6. Primitive values, Wrapper classes, Types and operations, concatenation, replacement, index of
casting operations). The class StringBuffer should be
introduced for those applications that involve
Primitive values and types: byte, int, short, long,
heavy manipulation of strings.
float, double, boolean, char. Corresponding
wrapper classes for each primitive type. Class as 11. Recursion
type of the object. Class as mechanism for user
Concept of recursion, simple recursive methods
defined types. Changing types through user
(e.g. factorial, GCD, binary search, conversion of
defined casting and automatic type coercion for
representations of numbers between different
some primitive types.
bases).
7. Variables, Expressions
Many problems can be solved very elegantly by
Variables as names for values; named constants observing that the solution can be composed of
(final), expressions (arithmetic and logical) and solutions to ‘smaller’ versions of the same
their evaluation (operators, associativity, problem with the base version having a known
precedence). Assignment operation; difference simple solution. Recursion can be initially
between left hand side and right hand side of motivated by using recursive equations to define
assignment. certain methods. These definitions are fairly
obvious and are easy to understand. The
8. Statements, Scope
definitions can be directly converted to a
Statements; conditional (if, if else, if else if, program. Emphasize that any recursion must
switch case, ternary operator), looping (for, have a base case. Otherwise, the computation
while, do while, continue, break); grouping can go into an infinite loop.
statements in blocks, scope and visibility of
The tower of Hanoi is a very good example of
variables.
how recursion gives a very simple and elegant
9. Methods solution where as non-recursive solutions are
quite complex.
Methods (as abstractions for complex user
defined operations on objects), formal arguments
and actual arguments in methods; different
behaviour of primitive and object arguments.
Static method and variables. The this Operator.
Examples of algorithmic problem solving using

7
 SECTION C (b) Single linked list (Algorithm and
programming), binary trees, tree traversals
Inheritance, Interface, Polymorphism, Data (Conceptual).
structures, Computational complexity The following should be covered for each
12. Inheritance, Interfaces and Polymorphism data structure:
(a) Inheritance; super and derived classes; Linked List (single): insertion, deletion,
member access in derived classes; reversal, extracting an element or a sublist,
redefinition of variables and methods in checking emptiness.
subclasses; abstract classes; class Object; Binary trees: apart from the definition the
protected visibility. Subclass polymorphism following concepts should be covered: root,
and dynamic binding. internal nodes, external nodes (leaves),
Emphasize inheritance as a mechanism to height (tree, node), depth (tree, node), level,
reuse a class by extending it. Inheritance size, degree, siblings, sub tree,
should not normally be used just to reuse completeness, balancing, traversals (pre,
some methods defined in a class but only post and in-order).
when there is a genuine specialization (or
14. Complexity and Big O notation
subclass) relationship between objects of the
super class and that of the derived class. Concrete computational complexity; concept of
input size; estimating complexity in terms of
(b) Interfaces in Java; implementing interfaces
methods; importance of dominant term;
through a class; interfaces for user defined
constants, best, average and worst case.
implementation of behaviour.
Big O notation for computational complexity;
Motivation for interface: often when creating
analysis of complexity of example algorithms
reusable classes some parts of the exact
using the big O notation (e.g. Various searching
implementation can only be provided by the
and sorting algorithms, algorithm for solution of
final end user. For example, in a class that
linear equations etc.).
sorts records of different types the exact
comparison operation can only be provided
by the end user. Since only he/she knows PAPER II: PRACTICAL – 30 MARKS
which field(s) will be used for doing the This paper of three hours’ duration will be evaluated
comparison and whether sorting should be in by the Visiting Examiner appointed locally and
ascending or descending order be given by approved by CISCE.
the user of the class.
The paper shall consist of three programming
Emphasize the difference between the Java
problems from which a candidate has to attempt any
language construct interface and the word
interface often used to describe the set of one. The practical consists of the two parts:
method prototypes of a class. 1. Planning Session
13. Data structures 2. Examination Session
(a) Basic data structures (stack, queue, circular The total time to be spent on the Planning session and
queue, dequeue); implementation directly the Examination session is three hours.
through classes; definition through an A maximum of 90 minutes is permitted for the
interface and multiple implementations by Planning session and 90 minutes for the Examination
implementing the interface. Conversion of session.
Infix to Prefix and Postfix notations. Candidates are to be permitted to proceed to the
Basic algorithms and programs using the Examination Session only after the 90 minutes of
above data structures. the Planning Session are over.
Data structures should be defined as abstract Planning Session
data types with a well-defined interface (it is The candidates will be required to prepare an
instructive to define them using the Java algorithm and a hand written Java program to solve
interface construct). the problem.

8
Examination Session EQUIPMENT
The program handed in at the end of the Planning There should be enough computers to provide for a
session shall be returned to the candidates. The teaching schedule where at least three-fourths of the
candidates will be required to key-in and execute the time available is used for programming.
Java program on seen and unseen inputs individually
on the Computer and show execution to the Visiting Schools should have equipment/platforms such that
Examiner. A printout of the program listing including all the software required for practical work runs
output results should be attached to the answer script properly, i.e. it should run at acceptable speeds.
containing the algorithm and handwritten program.
This should be returned to the examiner. The Since hardware and software evolve and change very
program should be sufficiently documented so that rapidly, the schools may have to upgrade them as
the algorithm, representation and development required.
process is clear from reading the program. Large Following are the recommended specifications as of
differences between the planned program and the now:
printout will result in loss of marks.
The Facilities:
Teachers should maintain a record of all the
assignments done as part of the practical work • A lecture cum demonstration room with a
through the year and give it due credit at the time of MULTIMEDIA PROJECTOR/ an LCD and
cumulative evaluation at the end of the year. Students O.H.P. attached to the computer.
are expected to do a minimum of twenty-five
assignments for the year. • A white board with white board markers should
be available.
EVALUATION:
• A fully equipped Computer Laboratory that
Marks (out of a total of 30) should be distributed as allows one computer per student.
given below:
Continuous Evaluation • Internet connection for accessing the World
Wide Web and email facility.
Candidates will be required to submit a work file
containing the practical work related to programming • The computers should have a minimum of
assignments done during the year. 1 GB RAM and a P IV or higher processor. The
Programming assignments done 10 marks basic requirement is that it should run the
throughout the year (Internal operating system and Java programming system
Evaluation) (Java compiler, Java runtime environment, Java
Programming assignments done 5 marks development environment) at acceptable speeds.
throughout the year (Visiting Examiner) • Good Quality printers.
Terminal Evaluation Software:
Solution to programming problem on 15 Marks
the computer • Any suitable Operating System can be used.
• JDK 6 or later.
Marks should be given for choice of algorithm and
implementation strategy, documentation, correct • Documentation for the JDK version being used.
output on known inputs mentioned in the question
• A suitable text editor. A development
paper, correct output for unknown inputs available environment with a debugger is preferred
only to the examiner. (e.g. BlueJ, Eclipse, NetBeans). BlueJ is
NOTE: recommended for its ease of use and simplicity.
Algorithm should be expressed clearly using any
standard scheme such as a pseudo code.

9
 SAMPLE TABLE FOR PRACTICAL WORK
Assessment of Assessment of the Practical Examination TOTAL MARKS
Practical File (To be evaluated by the Visiting Examiner only) (Total Marks are to
Unique be added and
Identification Internal Visiting Algorithm Java Program with Hard Output entered by the
S. No.
Number (Unique Evaluation Examiner internal Copy Visiting Examiner)
ID) of the candidate 10 Marks 5 Marks Documentation (printout)
3 Marks 7 Marks 2 Marks 3 Marks 30 Marks

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

Name of the Visiting Examiner:_________________________________

10