🇮🇳 NEET / State Class 12 Board (e.g. ISC) · subject
NEET / State Class 12 Board (e.g. ISC) Computer Science Syllabus
The Computer Science syllabus for NEET / State Class 12 Board (e.g. ISC) in full: 4 chapters, 12 topics and 25 sub-topics, every one listed below, plus 51 Computer Science flashcards with answers.
Computer Science syllabus: all 4 chapters
Expand any chapter to see its topics and sub-topics.
-
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
- Propositional Logic and Boolean Functions
-
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
- Fundamentals of Java
-
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
- Recursion
-
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
- Algorithm Design
NEET / State Class 12 Board (e.g. ISC) Computer Science flashcards — 51 questions with answers
What is a proposition in propositional logic?
A declarative statement that is either true or false, but not both.
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).
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.
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.
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.
What does the absorption law of Boolean algebra state?
A + A·B = A and A·(A + B) = A.
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.
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).
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.
What is a canonical SOP expression?
An SOP expression in which every product term is a minterm containing all the variables of the function.
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.
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.
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.
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.
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.
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.
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).
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).
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).
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.
Show the other 31 Computer Science flashcards
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.
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.
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).
In Java, what is the difference between the JDK, JRE, and JVM?
JVM executes bytecode; JRE = JVM + libraries needed to run programs; JDK = JRE + development tools (compiler, debugger) needed to write programs.
What are the eight primitive data types in Java?
byte, short, int, long, float, double, char, and boolean.
What is the difference between '==' and the .equals() method in Java?
'==' compares references (memory addresses) for objects; .equals() compares the actual contents/values of objects.
What is the difference between implicit and explicit type conversion in Java?
Implicit (widening) conversion is automatic from a smaller to larger type; explicit (narrowing) conversion uses a cast and may lose data.
What are the four pillars of Object-Oriented Programming?
Encapsulation, Inheritance, Polymorphism, and Abstraction.
Distinguish between a class and an object.
A class is a blueprint/template defining attributes and methods; an object is a concrete instance of a class occupying memory.
What is the difference between method overloading and method overriding in Java?
Overloading: same method name with different parameter lists in the same class (compile-time polymorphism). Overriding: subclass redefines a superclass method with the same signature (run-time polymorphism).
What does the keyword 'this' refer to in Java?
It refers to the current object on which the method or constructor is being invoked.
What is a constructor and how does it differ from a method?
A constructor initializes a new object; it has the same name as the class, has no return type, and is called automatically when the object is created.
What is the difference between a static variable and an instance variable?
A static (class) variable is shared by all objects of the class; an instance variable has a separate copy for each object.
How do you find the length of an array versus a String in Java?
For an array use the field array.length; for a String use the method str.length().
In Java, are array indices zero-based or one-based, and what is the index range for an array of size n?
Zero-based; valid indices range from 0 to n-1.
What is the difference between String, StringBuffer, and StringBuilder in Java?
String is immutable; StringBuffer is mutable and thread-safe (synchronized); StringBuilder is mutable but not synchronized (faster, single-threaded).
What does the substring(int beginIndex, int endIndex) method return in Java?
The substring from beginIndex (inclusive) to endIndex (exclusive).
What is recursion and what two components must every recursive method have?
Recursion is a method calling itself. It must have a base case (stopping condition) and a recursive case that progresses toward the base case.
What happens if a recursive method has no valid base case?
It recurses indefinitely, eventually causing a StackOverflowError due to stack memory exhaustion.
Write the recurrence for computing factorial(n) recursively.
factorial(n) = 1 if n = 0 or 1; otherwise factorial(n) = n × factorial(n-1).
How does the bubble sort algorithm work?
It repeatedly steps through the list, comparing adjacent elements and swapping them if out of order, so the largest element 'bubbles' to the end each pass.
How does selection sort work?
It repeatedly finds the minimum element from the unsorted portion and swaps it into its correct position at the front.
How does insertion sort work?
It builds a sorted portion one element at a time by taking the next element and inserting it into its correct position among the already-sorted elements.
What is the time complexity of linear search versus binary search?
Linear search is O(n); binary search is O(log n) but requires a sorted array.
What is the worst-case time complexity of bubble, selection, and insertion sort?
All three are O(n²) in the worst case.
What is the difference between an array and a linked list?
An array stores elements in contiguous memory with fixed size and O(1) random access; a linked list uses nodes with pointers, has dynamic size, and O(n) sequential access.
What is Big-O notation used to express?
The asymptotic upper bound on the growth rate of an algorithm's running time (or space) as input size increases.
In Java, what is the purpose of wrapper classes such as Integer and Double?
They wrap primitive types into objects, enabling use in collections and providing utility methods; e.g. Integer wraps int, Double wraps double.
What are autoboxing and unboxing in Java?
Autoboxing automatically converts a primitive to its wrapper object (int→Integer); unboxing converts a wrapper object back to a primitive (Integer→int).
In Java exception handling, what is the difference between 'throw' and 'throws'?
'throw' is used to explicitly raise an exception object inside code; 'throws' is declared in a method signature to indicate the exceptions a method may propagate.
What is the purpose of the 'finally' block in a try-catch statement?
It contains code that always executes whether or not an exception occurs, typically used for cleanup such as closing files or resources.
NEET / State Class 12 Board (e.g. ISC) Computer Science FAQ
What is in the NEET / State Class 12 Board (e.g. ISC) Computer Science syllabus?
NEET / State Class 12 Board (e.g. ISC) Computer Science is split into 4 chapters: Boolean Algebra, Object-Oriented Programming with Java, Data Structures and Recursion and Computational Thinking and Programming. Together they contain 12 topics and 25 sub-topics.
How many chapters are in NEET / State Class 12 Board (e.g. ISC) Computer Science?
4 chapters, containing 12 topics and 25 sub-topics. The largest chapter is Boolean Algebra, with 3 topics.
Are there flashcards for NEET / State Class 12 Board (e.g. ISC) Computer Science?
Yes — a 51-card Computer Science deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.