Std – 12

PORTION FOR FIRST TERM

Section – A

  • Revision of entire Portion from Std – XI 
  • (Excluding Number System & Representation of Numbers in a Computer)
  • Advanced Boolean Algebra
    • Concept of Minterms & Maxterms
    • Canonical Forms – SOP and POS
    • Karnaugh Maps
    • Reducing Boolean Expression through K-Maps

 

Section – B

  • Revision of Programming in Java
  • Java as Object Oriented Programming Language
  • Primitive & Reference Data types, Casting & Expressions
  • Conditional Statements & Iterative Statements
  • Functions/Methods & Constructors
  • Arrays as Single & Double Dimensional
  • String Manipulation

Section – C

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

 

PORTION FOR SECOND TERM

Section – A

  • Revision of entire First Term Portion
  • Application of Boolean Algebra & Logic Gates
    • Encoder
    • Decoder

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
    • Recursive Functions
  • Single & Double Dimensional Arrays
  • String Manipulation

Section – C

  • Recursive Data Structures
    • Linked Lists
      • Implementation of Stacks & Queues through Linked Lists
    • 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
      • Tree Traversals (Pre-Order Traversal, Post-Order Traversal, In-Order Traversal)
    • Complexity and Big – O notation
      • Big – O notation for  computational complexity
      • Time Complexity & Space Complexity
      • Best, Average and Worst Case

PORTION FOR FINAL TERM

 Section – A

  • Revision of entire First & Second Term Portion
  • Application of Boolean Algebra & Logic Gates
    • Multiplexer

Section – B

  • Revision of Programming in Java
  • Recursive Function (Revision)

Section – C

  • Recursive Data Structures
    • Dequeue
    • Linked Lists (Revision)
    • Binary Trees (Revision)
  • Complexity and Big – O notation (Revision)
Advertisements

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