Answer the following.
Show the case
Show answer
Answer
189 past-paper questions on Boolean Algebra from ISC Class 12 Computer Science papers (2026-2017), newest first, in full. Questions 1-20 are on this page, 20 to a page. Tap "Show answer" under a question to see its answer. The syllabus covers Propositional logic, Well formed formulae, Truth tables, Equivalence laws, Binary valued quantities, Postulates of Boolean algebra, Basic theorems of Boolean algebra and De Morgan's theorem and more.
Nothing matches. Try fewer letters.
Answer the following.
Answer
Answer the following using a truth table.
Answer
| A | B | ~B | A ∧ ~B | ~A | ~A ∨ B | (A ∧ ~B) => (~A ∨ B) |
| 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 | 1 |
Choose the correct option.
Answer
Correct option: (b)
Answer the following.
Answer
Prove the following.
Given: $[(a=>b) \cdot (b=>c)]$
To show: (a=>c)
Answer
Reduce the following using a Karnaugh map.
Answer
Groups: (0, 1, 2, 3, 8, 9, 10, 11) → B; (8, 9, 12, 13) → (A' + C); (3, 7, 11, 15) → (C' + D')
Reduced expression: F = B(A' + C)(C' + D')
Reduce the following using a Karnaugh map.
Answer
Groups: (0, 1, 8, 9) → B'C'; (0, 2, 8, 10) → B'D'; (0, 4, 8, 12) → C'D'
Reduced expression: F = B'C' + B'D' + C'D'

Choose the correct option.
Answer
Correct option: (c)
Choose the correct option.
Answer
Correct option: (b)
Answer the following using a truth table.
Answer
| A | B | A ⊕ B | A ⊙ B | (A ⊙ B)' | (A ⊕ B) = (A ⊙ B)' |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 0 | 1 |
Answer the following using a truth table.
| INPUTS | |
|---|---|
| V | Vehicle detected |
| S | Parking slot available |
| P | Payment confirmed |
| I | VIP access granted |
Answer
| V | S | P | I | VS + S(P + I) + P'I |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Answer the following.
Answer
Answer the following.
Answer
Answer the following.
Answer
Choose the correct option.
Answer
Correct option: (d)
Choose the correct option.
Answer
Correct option: (b)
Study the Assertion and Reason and choose the correct option.
Assertion: S1 and S2 are logically equivalent.
Reason: A conditional statement P => Q can be expressed as ~P V Q
Answer
Correct option: (a)
Reduce the following using a Karnaugh map.
Draw: logic gate diagram
Answer

Answer the following using a truth table.
| INPUTS | |
| C | Belongs to the Panda Clan |
| T | Trained for more than 5 years |
| P | Possesses Secret Chi Power |
| R | Recommended by the Grand Master |
Answer
| C | T | P | R | X |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Choose the correct option.
Answer
Correct option: (c)
Boolean Algebra is a unit of the ISC Class 12 Computer Science syllabus.
The syllabus lists these topics: Propositional logic, Well formed formulae, Truth tables, Equivalence laws, Binary valued quantities, Postulates of Boolean algebra, Basic theorems of Boolean algebra, De Morgan's theorem, SOP and POS forms and Karnaugh maps.
Prashnika has 189 past-paper questions on Boolean Algebra, from papers of 2017-2026, asked in 9 different years. By kind: MCQ (53), Short answer (40), Truth table (22) and Case based (16). They carry between 0.5 and 10 marks, and most are worth 1 mark.
To practise, use the Boolean algebra solver and the paper generator, which can build a practice paper from this chapter.
The syllabus lists Propositional logic, Well formed formulae, Truth tables, Equivalence laws, Binary valued quantities, Postulates of Boolean algebra, Basic theorems of Boolean algebra, De Morgan's theorem, SOP and POS forms and Karnaugh maps.
Prashnika has 189 questions on Boolean Algebra, from papers of 2017-2026 (board, specimen, improvement and practice papers together).
By kind: MCQ (53), Short answer (40), Truth table (22) and Case based (16).