Std – 12

SYLLABUS FOR THE ACADEMIC YEAR 2012-13

FIRST TERM

Section – A
• Boolean Algebra
o Revision and Continuation of Propositional Logic etc…
o Basic theorems of Boolean Algebra
 Laws of 0’s and 1’s
 Idempotence
 Commutative
 Associativity
 Distributive
 Complimentarity
 Absorption
 Involution
 De-Morgan’s Theorem
 Principle of Duality
• Advanced Boolean Algebra
o Canonical Forms – SOP and POS
o Karnaugh Maps
o Reducing Boolean Expression through K-Maps
• Computer Hardware
o Elementary Logic Gates – AND, OR , NOT and their circuits
o Universal Gates – NAND, NOR
o Other Gates – XOR and XNOR
• Application of Boolean Algebra & Logic Gates
o Inverter, Half Adder and Full Adder

Section – B
• Revision of Programming in JAVA…continuation
• Java as Object Oriented Programming Language
• Primitive & Reference Data types, Casting & Expressions
• Conditional Statements & Iterative Statements
• Functions/Methods & Constructors
• Arrays as Single & Multi Dimensional
• String Manipulation

Section – C
• Inheritance
o Base class and derived class
o Redefinition of variables and functions in sub-class
o Function Overriding
o Concept of Final, Super & Abstract

SECOND TERM

Section – A
• Revision of 1st & 2nd Term Yearly Syllabus
• Application of Boolean Algebra & Logic Gates
o Encoder
o Decoder and
o Multiplexer

Section – B
• Revision of Programming in JAVA…continuation
• Java as Object Oriented Programming Language
• Primitive & Reference Data types, Casting & Expressions
• Conditional Statements & Iterative Statements
• Functions/Methods & Constructors
• Arrays as Single & Multi Dimensional
• String Manipulation

Section – C
• Data Structures
o Basic data structures – STACK, QUEUE, and DEQUEUE. Implementation using Arrays.
o Definition through an interface and multiple implementations by implementing the interface.
o Basic algorithms using the above data structures.

• Recursive Data Structures
o Linked Lists
 Insertion
 Deletion
 Reversal
 Appending two lists

FINAL TERM

Section – A
• Revision of 1st and 2nd Term Portion

Section – B
• Revision of 1st and 2nd Term Portion

Section – C

o Linked Lists
 Implementation of Stacks & Queues through Linked Lists

o Binary Trees
 Height, Depth & Degree of Tree
 Node, Leaf, Branch, Edge & Path
 Concept of Parent Node, Daughter Node & Siblings
 External & Internal Nodes
 Concept of Sub Tree
.

o Tree Traversals
 Pre-Order Traversal
 Post-Order Traversal
 In-Order Traversal

• Complexity and Big – O notation
o Concrete computational complexity
o Concept of input size
o Estimating complexity in terms of functions
o Importance of Dominant Term
o Best, Average and Worst Case
o Big – O notation for computational complexity
o Analysis of complexity of example algorithms through Big – O
o Various searching sorting algorithms and Linear equations

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s