Prashnikaप्रश्निका
Code
About
Computer ScienceClass 12

Boolean Algebra - ISC Class 12 Computer Science Questions with Answers

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.

189questions
9years
2026newest
202620 questions
1 mark · Short answerOpen: Maxterm

Answer the following.

Maxterm
Show the case
Given that P = 0, Q = 1, R = 0, S = 0, write its:
Show answer

Answer

For P = 0, Q = 1, R = 0, S = 0: Maxterm = P + Q' + R + S
2 marks · Truth tableOpen: Draw a truth table to verify if the following proposition is a Tautology, a…

Answer the following using a truth table.

Draw a truth table to verify if the following proposition is a Tautology, a Contradiction or a Contingency. $(A \wedge \sim B) => (\sim A \vee B)$
Show answer

Answer

AB~BA ∧ ~B~A~A ∨ B(A ∧ ~B) => (~A ∨ B)
0010111
0100111
1011000
1100011
The last column has both 1s and 0s, so the proposition is a Contingency.
1 mark · MCQOpen: The complement of the Boolean expression p' · q' + c' + p' · q is:

Choose the correct option.

The complement of the Boolean expression $p' \cdot q' + c' + p' \cdot q$ is:
  • (a)$p + q \cdot c \cdot p + q'$
  • (b)$(p' + q) \cdot c \cdot (p + q')$
  • (c)$(p + q') \cdot c' \cdot (p + q')$
  • (d)$p' \cdot q + c + p \cdot q'$
Show answer

Answer

Checked answer.

Correct option: (b)

Answer: (b) By De Morgan's laws, the complement of $p' \cdot q' + c' + p' \cdot q$ is $(p' \cdot q')' \cdot (c')' \cdot (p' \cdot q)' = (p + q) \cdot c \cdot (p + q')$. Option (b) is the one with this form; it is printed in the paper as $(p' + q) \cdot c \cdot (p + q')$, where the first bracket should read $(p + q)$.
3 marks · Short answerOpen: The Modus Ponens states that (p ∧ (p ⇒ q)) ⇒ q. Prove this using Boolean laws.

Answer the following.

The Modus Ponens states that $(p \wedge (p \Rightarrow q)) \Rightarrow q$. Prove this using Boolean laws.
Show answer

Answer

To prove: $(p \wedge (p \Rightarrow q)) \Rightarrow q \equiv 1$ (a tautology) 1. $p \Rightarrow q = p' + q$ (Conditional/Implication law) 2. $p \wedge (p\Rightarrow q) = p\cdot(p'+q)$ (substituting step 1) 3. $= p\cdot p' + p\cdot q$ (Distributive law) 4. $= 0 + p\cdot q$ (Complement law: $p\cdot p'=0$) 5. $= p\cdot q$ (Identity law) 6. $(p\wedge(p\Rightarrow q))\Rightarrow q = (p\cdot q)\Rightarrow q = (p\cdot q)'+q$ (Conditional law, using step 5) 7. $= p'+q'+q$ (De Morgan's law) 8. $= p'+(q'+q)$ (Associative law) 9. $= p'+1$ (Complement law: $q'+q=1$) 10. $= 1$ (Null/Dominance law) Hence $(p\wedge(p\Rightarrow q))\Rightarrow q = 1$ for all values of $p,q$ — it is a tautology, which proves Modus Ponens. (Verified by truth table.)
3 marks · DerivationOpen: The Chain rule states that [(a=>b) · (b=>c)] => (a=>c). Prove this rule using…

Prove the following.

The Chain rule states that $[(a=>b) \cdot (b=>c)] => (a=>c)$. Prove this rule using Boolean laws.

Given: $[(a=>b) \cdot (b=>c)]$

To show: (a=>c)

Show answer

Answer

Proof of Chain Rule using Boolean laws: LHS = [(a => b) • (b => c)] => (a => c) = [(a' + b) • (b' + c)] => (a' + c) (Conditional Elimination: x => y = x' + y) = [(a' + b) • (b' + c)]' + (a' + c) (Conditional Elimination) = (a' + b)' + (b' + c)' + a' + c (De Morgan's Law) = (a • b') + (b • c') + a' + c (De Morgan's Law & Involution) = (a' + a • b') + (c + b • c') (Commutative & Associative Laws) = (a' + b') + (c + b) (Redundancy Law / Distributive Law) = a' + c + (b' + b) (Associative Law) = a' + c + 1 (Complement Law: b' + b = 1) = 1 (Properties of 1: x + 1 = 1) Since LHS simplifies to 1 (tautology), the rule is proved.
  1. Step 1: Write implication using conditional law: [(a' + b) • (b' + c)] => (a' + c)
  2. Step 2: Express the outer implication using x => y = x' + y: [(a' + b) • (b' + c)]' + (a' + c)
  3. Step 3: Apply De Morgan's Law to the first term: (a' + b)' + (b' + c)' + a' + c
  4. Step 4: Apply De Morgan's Law and Involution to each subterm: (a • b') + (b • c') + a' + c
  5. Step 5: Rearrange terms using Commutative and Associative laws: (a' + a • b') + (c + b • c')
  6. Step 6: Apply Absorption / Distributive Law (x' + x • y = x' + y): (a' + b') + (c + b)
  7. Step 7: Rearrange terms: a' + c + (b' + b)
  8. Step 8: Apply Complement Law (b' + b = 1): a' + c + 1
  9. Step 9: Apply Properties of 1 (x + 1 = 1): 1
  10. Step 10: Since the expression evaluates to 1, [(a=>b) • (b=>c)] => (a=>c) is identically true.
4 marks · K-mapOpen: Reduce the Boolean function F(A,B,C,D) = π (0,1,2,3,7,8,9,10,11,12,13,15) by…

Reduce the following using a Karnaugh map.

Reduce the Boolean function $F(A,B,C,D) = \pi (0,1,2,3,7,8,9,10,11,12,13,15)$ by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs).
Show answer

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')

Octet (0, 1, 2, 3, 8, 9, 10, 11) gives B. Quad (8, 9, 12, 13) gives (A' + C). Quad (3, 7, 11, 15) gives (C' + D').
5 marks · K-mapOpen: Reduce the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 8, 9, 10, 12) by…

Reduce the following using a Karnaugh map.

Reduce the Boolean function $F(A, B, C, D) = \Sigma(0, 1, 2, 4, 8, 9, 10, 12)$ by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs). Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
Show answer

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'

There is no octet. Three quads: (0, 1, 8, 9) gives B'C', (0, 2, 8, 10) gives B'D' and (0, 4, 8, 12) gives C'D'. Logic gate diagram: three 2-input AND gates feeding one 3-input OR gate.
Diagram for this answer
1 mark · MCQOpen: According to the Principle of Duality, the Boolean equation Q' · 0 + P' · Q' +…

Choose the correct option.

According to the Principle of Duality, the Boolean equation $Q' \cdot 0 + P' \cdot Q' + P' \cdot Q = P'$ will be equivalent to:
  • (a)$Q \cdot 0 + P \cdot Q + P \cdot Q' = P$
  • (b)$Q' \cdot 1 + P' \cdot Q' + P \cdot Q' = P'$
  • (c)$(Q' + 1) \cdot (P' + Q') \cdot (P' + Q) = P'$
  • (d)$(Q' + 0) \cdot (P' + Q') \cdot (P' + Q) = P'$
Show answer

Answer

Correct option: (c)

Answer: (c) (Q' + 1) • (P' + Q') • (P' + Q) = P' According to the Principle of Duality, each AND operator (•) is replaced by OR (+), each OR operator (+) is replaced by AND (•), and each 0 is replaced by 1, leaving the variables/literals unchanged.
1 mark · MCQOpen: The Boolean equations a + 1 = 1 and a · 0 = 0 correspond to:

Choose the correct option.

The Boolean equations $a + 1 = 1$ and $a \cdot 0 = 0$ correspond to:
  • (a)Involution Law
  • (b)Law of Identity
  • (c)Distributive Law
  • (d)Law of Complements
Show answer

Answer

Correct option: (b)

Answer: (b) Law of Identity In the syllabus and standard textbook classification of Boolean properties of 0 and 1, operations with 0 and 1 (properties of 0 and 1) are categorized under the identity properties of 0 and 1. None of the other given options (Involution, Distributive, Law of Complements) apply.
2 marks · Truth tableOpen: Draw a truth table to verify if the following proposition is a Tautology, a…

Answer the following using a truth table.

Draw a truth table to verify if the following proposition is a Tautology, a Contradiction or a Contingency. $(A \oplus B) = (A \odot B)'$
Show answer

Answer

ABA ⊕ BA ⊙ B(A ⊙ B)'(A ⊕ B) = (A ⊙ B)'
000101
011011
101011
110101
The last column is 1 in every row, so the proposition is a Tautology.
5 marks · Truth tableOpen: An automated parking gate uses four binary sensors. The parking gate should…

Answer the following using a truth table.

An automated parking gate uses four binary sensors. The parking gate should open under any one of the following conditions: • Vehicle detected and parking slot available OR • Parking slot available and either payment confirmed or VIP access granted OR • Payment not confirmed but VIP access granted The inputs are:
INPUTS
VVehicle detected
SParking slot available
PPayment confirmed
IVIP access granted
(In all the above cases, 1 indicates YES and 0 indicates NO) Output: X - Denotes opening of the parking gate (1 = Open, 0 = Close) Draw the truth table for the inputs and outputs given above. Write the SOP expression for $X(V, S, P, I)$.
Show answer

Answer

VSPIVS + S(P + I) + P'I
00000
00011
00100
00110
01000
01011
01101
01111
10000
10011
10100
10110
11001
11011
11101
11111
Minimal SOP: $X = VS + SP + SI + P'I$ reduces to $X = VS + SP + P'I$, which is the same function. Canonical SOP: $X = \Sigma(1, 5, 6, 7, 9, 12, 13, 14, 15)$ in the order V, S, P, I.
2 marks · Short answerOpen: Given F(P, Q, R) = π(0, 1, 4, 7) write its canonical form.

Answer the following.

Given $F(P, Q, R) = \pi(0, 1, 4, 7)$ write its canonical form.
Show answer

Answer

$F(P,Q,R) = \pi(0,1,4,7)$ means the maxterms are $M_0,M_1,M_4,M_7$: $M_0=(P+Q+R)$, $M_1=(P+Q+R')$, $M_4=(P'+Q+R)$, $M_7=(P'+Q'+R')$ Canonical (POS) form: $F(P,Q,R) = (P+Q+R)\cdot(P+Q+R')\cdot(P'+Q+R)\cdot(P'+Q'+R')$
1 mark · One wordOpen: Write the reduced expression of F(A, B, C) = π(0, 1, 2, 3, 4, 5, 6, 7)

Answer the following.

Write the reduced expression of $F(A, B, C) = \pi(0, 1, 2, 3, 4, 5, 6, 7)$
Show answer

Answer

$F(A,B,C) = \pi(0,1,2,3,4,5,6,7)$ includes every one of the 8 possible maxterms for 3 variables, which means the function equals 0 for every input combination. Reduced expression: $F(A,B,C) = 0$
1 mark · MCQOpen: The Boolean equations p + p' = 1 and p · p' = 0 correspond to:

Choose the correct option.

The Boolean equations $p + p' = 1$ and $p \cdot p' = 0$ correspond to:
  • (a)Involution Law
  • (b)Absorption Law
  • (c)Commutative Law
  • (d)Complement Law
Show answer

Answer

Correct option: (d)

Answer: (d) Complement Law The laws $p+p'=1$ and $p \cdot p' = 0$ are known as the Complement Law of Boolean algebra.
1 mark · MCQOpen: The complement of the Boolean expression a · b' + a' + a' · b is:

Choose the correct option.

The complement of the Boolean expression $a \cdot b' + a' + a' \cdot b$ is:
  • (a)$a + b' \cdot a' \cdot a' + b$
  • (b)$(a' + b) \cdot a \cdot (a + b')$
  • (c)$(a + b') \cdot a' \cdot (a + b')$
  • (d)$a' \cdot b + a + a \cdot b'$
Show answer

Answer

Correct option: (b)

Answer: (b) (a' + b) • a • (a + b') By De Morgan's laws: (a • b' + a' + a' • b)' = (a • b')' • (a')' • (a' • b)' = (a' + b) • a • (a + b').
1 mark · Assertion-reasonOpen: S1 and S2 are logically equivalent. P = You practise regularly Q = You become…

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

P = You practise regularly Q = You become skilled S1 = $P => Q$ S2 = $\sim P \vee Q$
  • (a)Both Assertion and Reason are true and Reason is the correct explanation for Assertion.
  • (b)Both Assertion and Reason are true but Reason is not the correct explanation for Assertion.
  • (c)Assertion is true and Reason is false.
  • (d)Both Assertion and Reason are false.
Show answer

Answer

Correct option: (a)

Answer: (a) Both Assertion and Reason are true and Reason is the correct explanation for Assertion. The conditional statement P => Q is logically equivalent to ~P v Q by the conditional elimination law. Thus, both statements are true and Reason explains Assertion.
1 mark · DrawingOpen: Draw the logic gate diagram for the reduced expression. Assume that the…

Reduce the following using a Karnaugh map.

Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.

Draw: logic gate diagram

Show answer

Answer

Logic gate diagram for $F = B \cdot (A'+C) \cdot (C'+D')$: two 2-input OR gates (A', C) and (C', D') feed a 3-input AND gate together with B.
Diagram for this answer
5 marks · Long answerOpen: According to the ancient laws of the Valley of Peace, a candidate can become…

Answer the following using a truth table.

According to the ancient laws of the Valley of Peace, a candidate can become the Dragon Warrior only if they satisfy any one of the following conditions: • The candidate belongs to the Panda Clan and has been trained for more than 5 years under the Grand Master OR • The candidate possesses the Secret Chi Power but does not belong to the Panda Clan OR • The candidate is recommended by the Grand Master, but neither belongs to the Panda Clan nor has been trained for more than 5 years The inputs are:
INPUTS
CBelongs to the Panda Clan
TTrained for more than 5 years
PPossesses Secret Chi Power
RRecommended by the Grand Master
(In all the above cases, 1 indicates YES and 0 indicates NO) Output: X - Denotes eligibility to become the Dragon Warrior (1 = eligible and 0 = not eligible) Draw the truth table for the inputs and outputs given above. Write the SOP expression for X(C, T, P, R).
Show answer

Answer

Condition 1: C • T Condition 2: C' • P Condition 3: C' • T' • R Eligibility function: X = C • T + C' • P + C' • T' • R Truth Table:
CTPRX
00000
00011
00101
00111
01000
01010
01101
01111
10000
10010
10100
10110
11001
11011
11101
11111
SOP Expression for X(C, T, P, R): In minterm notation: X(C, T, P, R) = Σ(1, 2, 3, 6, 7, 12, 13, 14, 15) Canonical SOP expression: X(C, T, P, R) = C'T'P'R + C'T'PR' + C'T'PR + C'TPR' + C'TPR + CTP'R' + CTP'R + CTPR' + CTPR
1 mark · MCQOpen: According to the Principle of Duality, the Boolean equation A + B' · C + A' · B…

Choose the correct option.

According to the Principle of Duality, the Boolean equation $A + B' \cdot C + A' \cdot B \cdot C' = (A' + 0) \cdot (B + 1)$ will be equivalent to:
  • (a)$(A \cdot B + C) \cdot (A' + (B + C')) = (A' \cdot 1) + (B \cdot 0)$
  • (b)$(A \cdot B') + C \cdot (A' + B + C') = (A + 1) \cdot (B' + 0)$
  • (c)$A \cdot (B' + C) \cdot (A' + B + C') = (A' \cdot 1) + (B \cdot 0)$
  • (d)$(A \cdot B' \cdot C' + A \cdot B + A' \cdot C) = (B' \cdot 1) \cdot (A \cdot 0)$
Show answer

Answer

Correct option: (c)

Answer: (c) $A \cdot (B' + C) \cdot (A' + B + C') = (A' \cdot 1) + (B \cdot 0)$ By the Principle of Duality, every $+$ is replaced by $\cdot$, every $\cdot$ by $+$, and every $0$ by $1$ (and vice versa), while the variables/complements are left unchanged. Applying this to $A + B'\cdot C + A'\cdot B\cdot C' = (A'+0)\cdot(B+1)$ gives $A\cdot(B'+C)\cdot(A'+B+C') = (A'\cdot 1)+(B\cdot 0)$, which is option (c).

About Boolean Algebra

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.

Common questions

What topics are in Boolean Algebra in ISC Class 12 Computer Science?

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.

How many questions on Boolean Algebra are in ISC Class 12 Computer Science past papers?

Prashnika has 189 questions on Boolean Algebra, from papers of 2017-2026 (board, specimen, improvement and practice papers together).

What kinds of questions are asked on Boolean Algebra?

By kind: MCQ (53), Short answer (40), Truth table (22) and Case based (16).

Questions on other pages on Boolean Algebra