Class XII - Syllabus


Section - A

Boolean Algebra

Propositional logic, well formed formulae, truth values and interpretation of well formed formulae (wff), truth tables, satisfiable, unsatisfiable and valid formulae. Equivalence laws and their use in simplifying wffs.
Binary valued quantities; basic postulates of Boolean algebra; operations AND, OR and NOT; truth tables
Basic theorems of Boolean algebra (e.g. Duality, idempotence, commutativity, associativity, distributivity, operations with 0 and 1, complements, absorption, involution); De Morgan’s theorem and its applications; reducing Boolean expressions to sum of products and product of sums forms; Karnaugh maps (up to four variables).

Section - B


Computer Hardware

Elementary logic gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and their use in circuits.

Applications of Boolean algebra and logic gates to half adders, full adders, encoders, decoders, multiplexers, NAND, NOR as universal gates.

Section - C 

Algorithm to solve problems

Implementation of algorithms to solve problems

Programming in Java

Objects as data

Analysis of some real world programming examples in terms of objects and classes

Primitive values, wrapper classes, types and casting

Variables, expressions

Statements, scope


Arrays, strings

Section - D

Inheritance, polymorphism, data structures, computational complexity

Data structures

Complexity and big O notation