Std – 11

PORTION FOR FIRST TERM

Section – A

  • Number System
    • Representation of numbers in different bases
    • Inter-conversion of numbers from different bases
      • Decimal, Binary, Octal, Hexadecimal
    • Addition and Subtraction of Numbers in different bases

 

  • Representation of Numbers in a Computer
    • Sign & Magnitude notation
    • 1’s, 2’s, 7’s, 8’s, 15’s and 16’s Complement

 

Section – B

  • Introduction to Algorithmic problem solving in JAVA (for Lab Journal)
    • Writing the Algorithm first and then conversion of Algorithm to Program

 Classes & Objects

    • Programs with concepts of classes, objects and multiple functions
    • Scope and visibility of variables
  • Selection Structure programs
    • Conditional statements like if, if…else, if…else if…else
    • Switch…Case, usage of default and break (fall-through)
  • Iterative Structure Programs
    • for (. . .), while( ) and do…while( )
  • Programming with Arrays (Single Dimension)
    • Searching, Sorting, Merging 
  • Functions
    • Pre defined functions (Library Functions)
    • User defined functions 
  • Strings Handling

 

PORTION FOR SECOND TERM

Section – A

  • Propositional Logic
    • Propositional Logic
    • Sentences and Connectives
      • Conjunction, Disjunction, Negation, Conditional, Bi-conditional
    • Related Terminologies
      • Tautology, Contradiction, Converse, Inverse, Contrapositive
    • Truth Tables and Truth Values
    • Equivalence Laws of Boolean Algebra
      • Properties of 0 and 1, Idempotence, Involution, Associative, Absorption, Complementarity, Distributive, De Morgan’s Law
    • Principle of Duality
  • Logic Gates and Hardware
    • Basic Gates – AND,  OR , NOT
    • Universal Gates – NAND, NOR
    • Other Gates – XOR and XNOR
  • Address Calculation in Two Dimensional Arrays
    • Row Major & Column Major

Section – B

  • Function
    • Problem solving using user defined & library functions
  • Arrays
    • Double Dimensional Arrays

Section – C

  • File Handling
    • Text Files – Creation, Reading, Appending

PORTION FOR FINAL TERM

Section – A

  • Propositional Logic
    • Syllogism
    • Modus Ponens
    • Chain Rule
  • Logic Gates and Hardware
    • Universal Gates – NAND, NOR
    • Derivation of Basic gates using Universal Gates
    • Half Adder and Full Adder

Section – B

  • Strings
    • String Manipulation
  • Exception Handling
    • Compile time and Runtime errors, Concept of exception
    • Exception class – try, catch, throw

Section – C

  • Basic Data Structure
    • Stack & Queues using Arrays
Advertisements
Comments
  1. abhishek shahi says:

    love you sir …
    Iski atyadhik avashyakta thi 🙂

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