ISC Class 12 Syllabus 2024 Computer Science

ISC
Syllabus

2024

Revised

Syllabus

COMPUTER SCIENCE (868)
CLASS XII

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

1

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

2

subclasses; abstract classes; class Object; Planning session and 90 minutes for the Examination
protected visibility. Subclass polymorphism session.
and dynamic binding. Candidates are to be permitted to proceed to the
Emphasize inheritance as a mechanism to Examination Session only after the 90 minutes of
reuse a class by extending it. Inheritance the Planning Session are over.
should not normally be used just to reuse Planning Session
some methods defined in a class but only
when there is a genuine specialization (or The candidates will be required to prepare an
subclass) relationship between objects of the algorithm and a hand written Java program to solve
super class and that of the derived class. the problem.
(b) Interfaces in Java (Conceptual) Examination Session
Emphasize the difference between the Java The program handed in at the end of the Planning
language construct interface and the word session shall be returned to the candidates. The
interface often used to describe the set of candidates will be required to key-in and execute the
method prototypes of a class. Java program on seen and unseen inputs individually
on the Computer and show execution to the Visiting
13. Data structures Examiner. A printout of the program listing including
(a) Basic data structures (stack, linear queue); output results should be attached to the answer script
implementation directly through classes. containing the algorithm and handwritten program.
Conversion of Infix to Prefix and Postfix This should be returned to the examiner. The
notations. program should be sufficiently documented so that
the algorithm, representation and development
Basic algorithms and programs using the
process is clear from reading the program. Large
above data structures.
differences between the planned program and the
(b) Binary trees, tree traversals (Conceptual). printout will result in loss of marks.
The following should be covered: Teachers should maintain a record of all the
Binary trees- apart from the definition the assignments done as part of the practical work
following concepts should be covered: root, through the year and give it due credit at the time of
internal nodes, external nodes (leaves), cumulative evaluation at the end of the year. Students
height (tree, node), depth (tree, node), level, are expected to do a minimum of twenty-five
size, degree, siblings, sub tree, assignments for the year.
completeness, balancing, traversals (pre,
post and in-order). EVALUATION:
14. Complexity (Conceptual) Marks (out of a total of 30) should be distributed as
given below:
Concept of complexity; input size; importance of
dominant term; constants, best, average and Continuous Evaluation
worst case. Candidates will be required to submit a work file
PAPER II: PRACTICAL – 30 MARKS containing the practical work related to programming
assignments done during the year.
This paper of three hours’ duration will be evaluated Programming assignments done 10 marks
by the Visiting Examiner appointed locally and throughout the year (Internal
approved by the Council. Evaluation)
The paper shall consist of three programming Programming assignments done 5 marks
problems from which a candidate has to attempt any throughout the year (Visiting Examiner)
one. The practical consists of the two parts: Terminal Evaluation
1. Planning Session Solution to programming problem on 15 Marks
2. Examination Session the computer
The total time to be spent on the Planning session and Marks should be given for choice of algorithm and
the Examination session is three hours. implementation strategy, documentation, correct
A maximum of 90 minutes is permitted for the
output on known inputs mentioned in the question

3

paper, correct output for unknown inputs available Software:
only to the examiner.
• Any suitable Operating System can be used.
NOTE:
• JDK 6 or later.
Algorithm should be expressed clearly using any
standard scheme such as a pseudo code. • Documentation for the JDK version being used.
EQUIPMENT • A suitable text editor. A development
environment with a debugger is preferred
There should be enough computers to provide for a (e.g. BlueJ, Eclipse, NetBeans). BlueJ is
teaching schedule where at least three-fourths of the recommended for its ease of use and simplicity.
time available is used for programming.
Schools should have equipment/platforms such that
all the software required for practical work runs
properly, i.e. it should run at acceptable speeds.
Since hardware and software evolve and change very
rapidly, the schools may have to upgrade them as
required.
Following are the recommended specifications as of
now:
The Facilities:
• A lecture cum demonstration room with a
MULTIMEDIA PROJECTOR/ an LCD and
O.H.P. attached to the computer.
• A white board with white board markers should
be available.
• A fully equipped Computer Laboratory that
allows one computer per student.
• Internet connection for accessing the World
Wide Web and email facility.
• The computers should have a minimum of
1 GB RAM and a P IV or higher processor. The
basic requirement is that it should run the
operating system and Java programming system
(Java compiler, Java runtime environment, Java
development environment) at acceptable speeds.
• Good Quality printers.

4

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:_________________________________
Signature: _______________________________
Date:___________________________________

5