Specimen2025
ISC Computer Science (Paper 1 — Theory) — Specimen Question Paper 2025
ISC Class XII Board Examination · Computer Science
- Marks
- Not verified
- Duration
- Not verified
ISC Class XII · ICSE
Computer Science
Chapter-wise questions, previous-year questions and papers for Computer Science at ISC Class XII Board Examination.
- Chapters
- 11
- Questions
- 79
- PYQs
- 0
- Papers
- 1
Chapters
Mapped from the published ICSE syllabus and linked back to cisce.org. Question counts are live.
Section A
- 5questions
1. Boolean Algebra
Boolean laws, De Morgan's theorems, canonical forms, and the conversion of a truth table to a Boolean expression.
- 6questions
2. Karnaugh Maps
Reducing Boolean expressions with three and four variables using K-maps, and reading off the minimal SOP and POS forms.
- 6questions
3. Combinational and Sequential Logic Circuits
Logic gates, half and full adders, encoders, decoders, multiplexers and flip-flops.
Section B
- 6questions
4. Inheritance and Polymorphism
Single and multilevel inheritance, method overriding and overloading, abstract classes and interfaces.
- 6questions
5. Recursion
Recursive definitions, the base case, the recursive case, and recursion versus iteration.
- 6questions
6. Arrays
Single- and double-dimensional arrays, searching, sorting, and array-based problems.
- 6questions
7. String Handling
String and StringBuffer, string methods, and palindrome, anagram and word-level problems.
Section C
- 4questions
8. Complexity and Big O Notation
Measuring the running time of an algorithm and expressing it in big O notation.
- 4questions
9. Stacks
The stack as a LIFO structure, push and pop, overflow and underflow, and applications of stacks.
- 4questions
10. Queues
The queue as a FIFO structure, insertion and deletion, circular queues and dequeues.
- 5questions
11. Linked Lists
Nodes and references, singly linked lists, insertion and deletion, and traversal.
Chapter mapping:ISC syllabus (CISCE)
Papers
Recent questions
Class 12 · Computer Science
A matrix M[-6….10, 4…15] is stored in the memory with each element requiring
4 bytes of storage. If the base address is 1025, find the address of M when
the matrix is stored in column major wise.2 marksShort answer
Class 12 · Computer Science
(a) Reduce the Boolean function F(P,Q,R,S) = (P+Q+R+S) •(P+Q+R+Sꞌ) •
(P+Q+Rꞌ+S)•(P+Qꞌ+R+S) • (P+Qꞌ+R+Sꞌ) • (P+Qꞌ+Rꞌ+S) • (P+Qꞌ+Rꞌ+Sꞌ)
•(Pꞌ+Q+R+S)• (Pꞌ+Q+R+Sꞌ) by using 4-variable Karnaugh map, showing the
various groups (i.e. octal, quads and pairs).
(b) Draw the logic gate diagram for the reduced expression. Assume that the
variables and their complements are available as inputs.
--------------------------------------------------------------------------------------------------------------------------------4 marksMap based
Class 12 · Computer Science
For Big O notation, state the difference between O(n) and O(n2).
1 markShort answer
Class 12 · Computer Science
From the given logic diagram :
(a) Derive Boolean expression and draw the truth table for the derived
expression.
(b) If A=1, B=0 and C=1 then find the value of X.4 marksDiagram based