Std – 11


Section – A
• Numbers
o Representation of numbers in different bases
o Inter-conversion of numbers from different bases
 Decimal, Binary, Octal & Hexadecimal
o Addition and Subtraction of Numbers in different bases
• Encoding
o Sign & Magnitude notation
o One’s Compliment & Two’s Compliment
o Basic operation on Integer and floating point numbers
o Character and their encoding – ASCII and UNICODE
• Propositional Logic
o Propositional Logic
o Sentences and Connectives
 Conjunction
 Disjunction
 Negation
 Conditional
 Bi-conditional
o Related Terminology
 Tautology, Contradiction, Converse, Inverse, Contrapositive
o Truth Tables and Truth Values
o Equivalence Laws of Boolean Algebra
 Properties of 0 and 1, Idempotence, Involution, Associative, Absorption, Complimentarity, Distributive etc…
 De Morgan’s Law
• Logic and Hardware
o Basic Gates – AND, OR , NOT
o Universal Gates – NAND, NOR
o Other Gates – XOR and XNOR

Section – B
• Introduction to Algorithmic problem solving in JAVA
o Writing the Algorithm first and then conversion of Algorithm to Program
• Classes & Objects
o Programs with concepts of classes, objects and multiple functions
• Primitive values, Wrapper class, Types and Casting
o Primitive values and types Corresponding wrapper class for primitive data types
o Class mechanism for user defined types
o User defined (explicit) type casting
o Automatic (implicit) type Coercion
o Potential Problems related to type conversions
• Variables & Expression
• Statements & Scope
• Selection Structure programs
o Conditional statements like if, if…else, if…else if…else
o Ternary operator (Conditional op. ? : )
o Switch…case, usage of default and break (fall-through)
• Iterative Structure Programs
o Looping with for (. . .),
o while( ), and do…while( )
o Grouping statements in Blocks
o Scope and visibility of variables
• Programming with Arrays (Single Dimension)
o Searching
o Sorting
o Merging
• Functions
o User defined and in built methods
• Strings


Section – A
• Propositional Logic
o Syllogism
o Modus Ponens and Chain Rule
• Logic and Hardware
o Basic Gates – AND, OR , NOT
o Universal Gates – NAND, NOR
o Other Gates – XOR and XNOR
o Derivation of Basic gates using Universal Gates
o Half Adder and Full Adder

Section – B
• Function
o Function / methods
(as abstraction for complex user defined operations on objects)
o Function as mechanism for side effects
o Actual and formal arguments
o call by value and reference
o Static variables and functions,
o Algorithmic problem solving using functions

• Arrays and Strings
o Structured data type – Arrays
o Multidimensional arrays
o Searching, Sorting, Min and Max, Linear Equations
o Strings – Searching, Sorting, Substring, Length, Concatenation, access to characters
o Compile time and Runtime errors, Concept of exception
o Exception class – try, catch, throw

Section – C
• Implementation of Algorithm to solve problems
• Structured data type – Double Dimensional Array
• File Handling – Text Files


Section A
• Revision of Sec – A (from 1st and 2nd Terms)
• Address Calculation in Two Dimensional Arrays
o Row Major
o Column Major

Section B
• Revision of Programs from 1st & 2nd Terms
o Functions
o Constructors
o Arrays
o String Manipulation
o String Buffer & String Tokenizer classes

Section – C
• File Handling – Text & Binary Files
• Basic Data Structure
o Stack using Arrays

  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: Logo

You are commenting using your 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