NEET / State Class 12 Board (e.g. ISC) Computer Science Syllabus

Computer Science syllabus — full chapter and topic list

Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Computer Science in NEET / State Class 12 Board (e.g. ISC), not a summary of it.

1. 1

   Boolean Algebra

   3 topics

   • Propositional Logic and Boolean Functions
     • Truth tables and logic propositions
     • Boolean laws, De Morgan's theorems
   • Minimisation Techniques
     • Sum of Products and Product of Sums
     • Karnaugh maps for up to four variables
   • Logic Gates and Circuits
     • Basic, universal and derived gates
     • Half adder and full adder circuits
2. 2

   Object-Oriented Programming with Java

   3 topics

   • Fundamentals of Java
     • Data types, operators and control structures
     • Classes, objects and methods
   • OOP Concepts
     • Encapsulation, inheritance and polymorphism
     • Constructors and method overloading
     • Abstraction and access modifiers
   • Arrays and Strings
     • Single and double dimensional arrays
     • String and StringBuffer methods
3. 3

   Data Structures and Recursion

   3 topics

   • Recursion
     • Recursive functions and base case
     • Factorial, Fibonacci and tower of Hanoi
   • Arrays and Sorting
     • Linear and binary search
     • Bubble, selection and insertion sort
   • Linked Structures and Complexity
     • Stacks and queues using arrays
     • Time complexity and Big-O notation
4. 4

   Computational Thinking and Programming

   3 topics

   • Algorithm Design
     • Flowcharts and pseudocode
     • Iteration versus recursion
   • Library Classes and Wrapper Classes
     • Wrapper classes and autoboxing
     • Math and Character library methods
   • Exception Handling and File Concepts
     • try-catch-finally blocks
     • Checked and unchecked exceptions

Computer Science flashcards for NEET / State Class 12 Board (e.g. ISC)

23 of 51 cards from the Computer Science deck — real questions with worked answers.

1. What is a proposition in propositional logic?

   A declarative statement that is either true or false, but not both.

2. State the truth value of P → Q (implication) for each combination of P and Q.

   P→Q is false only when P is true and Q is false; it is true in all other three cases (T-T, F-T, F-F).

3. What is a tautology, a contradiction, and a contingency?

   Tautology: always true for all inputs. Contradiction: always false. Contingency: true for some inputs and false for others.

4. State De Morgan's Theorems for Boolean algebra.

   (A·B)' = A' + B' and (A + B)' = A'·B'. The complement of a product is the sum of complements, and vice versa.

5. What is the difference between a tautology and a logical equivalence?

   A tautology is a single proposition always true; a logical equivalence (P ≡ Q) means P and Q have identical truth tables, i.e. P↔Q is a tautology.

6. What does the absorption law of Boolean algebra state?

   A + A·B = A and A·(A + B) = A.

7. What is the dual of a Boolean expression and how is it obtained?

   The dual is obtained by interchanging AND with OR and 0 with 1, leaving variables unchanged.

8. Distinguish between SOP and POS forms.

   SOP (Sum of Products) is an OR of AND terms (minterms); POS (Product of Sums) is an AND of OR terms (maxterms).

9. Define a minterm and a maxterm.

   A minterm is a product (AND) term containing every variable once (true/complemented) that is 1 for exactly one input combination. A maxterm is a sum (OR) term that is 0 for exactly one combination.

10. What is a canonical SOP expression?

    An SOP expression in which every product term is a minterm containing all the variables of the function.

11. What is the purpose of a Karnaugh map (K-map)?

    To simplify Boolean expressions graphically by grouping adjacent 1s (or 0s) to eliminate variables and obtain a minimal expression.

12. In a K-map, what sizes can valid groups be, and why must they be powers of 2?

    Groups must contain 1, 2, 4, 8, 16... cells (powers of 2) because each doubling eliminates one variable, ensuring valid simplification.

13. What is a 'don't care' condition in a K-map?

    An input combination that never occurs or whose output is irrelevant; marked X and can be treated as 0 or 1 to form larger groups for greater simplification.

14. Why must adjacent cells in a K-map differ by only one bit (Gray code ordering)?

    So that adjacent cells differ in exactly one variable, allowing that variable to be eliminated when the cells are grouped.

15. What is a prime implicant and an essential prime implicant?

    A prime implicant is a group that cannot be combined into a larger group. An essential prime implicant covers at least one minterm not covered by any other prime implicant.

16. What is the basic operation of the Quine-McCluskey method?

    A tabular minimisation technique that systematically combines minterms differing in one bit to find prime implicants, then selects essential ones via a prime implicant chart.

17. Give the truth table outputs of a 2-input AND gate.

    Output is 1 only when both inputs are 1; otherwise 0 (0·0=0, 0·1=0, 1·0=0, 1·1=1).

18. Give the truth table outputs of a 2-input OR gate.

    Output is 0 only when both inputs are 0; otherwise 1 (0+0=0, 0+1=1, 1+0=1, 1+1=1).

19. What is the output of a 2-input XOR gate?

    Output is 1 when the inputs are different, and 0 when they are the same (A⊕B).

20. Why are NAND and NOR called universal gates?

    Because any Boolean function (AND, OR, NOT) can be implemented using only NAND gates or only NOR gates.

21. What is the difference between a half adder and a full adder?

    A half adder adds two bits giving sum and carry. A full adder adds three bits (two inputs plus carry-in) giving sum and carry-out.

22. What logic gate represents the function 'output 1 only when both inputs are 1' inverted?

    The NAND gate: output is 0 only when both inputs are 1, otherwise 1.

23. What is the difference between a combinational and a sequential circuit?

    A combinational circuit's output depends only on current inputs; a sequential circuit's output depends on current inputs and stored past state (memory).

See more Computer Science flashcards →

Planning Computer Science for NEET / State Class 12 Board (e.g. ISC)

Computer Science (NEET / State Class 12 Board (e.g. ISC)) FAQ