Related Concepts: 01 Boolean Algebra Foundations & Duality Principle | 04 Mathematical Conversions & Expansion of SOP and POS | 05 Tabular Method (Quine-McCluskey) & Prime Implicants
3.06 Boolean Algebra Puzzles & Exam Proofs
Exam Edge Cases & Mathematical Puzzles
High-yield exam questions often include 9 to 11-mark mathematical “puzzles” testing reverse-engineering, factoring constraints, and multi-variable gate expansions.
1. The 5-Variable “Reverse Don’t Care” Puzzle
Major PYQ Problem (2017, 2020 - 11 Marks)
Question: The expression is a simplified version of . Are there any don’t care conditions? If so, what are they?
Solution:
Step 1: Minterms of Unsimplified Expression ()
Expand each 5-variable term ():
Step 2: Minterms of Simplified Expression ()
Step 3: Isolate Don’t Care Minterms
2. The 8-Literal Limit Factoring Puzzle
Major PYQ Problem (2022 - 9 Marks)
Question: Express in three different ways using 8 or fewer literals.
Solution:
Way 1: Group by and
Using absorption identity :
Way 2: Group by and
Expand Way 1:
Way 3: Group by and
3. 4-Variable XNOR Expansion Proof
OCR Exam Scanner Typo Correction
PYQ 2017 text writes . This is an OCR typo. Minterm 0 () evaluates to 0 in XOR. The true textbook question (Morris Mano 4-23) uses XNOR ().
Major PYQ Proof (2017 - 10 Marks)
Question: Show that .
Proof Solution:
Let and .
Substitute into : Evaluating these 8 product terms:
Past Year Questions (PYQs)
- [PYQ 2017, 2020]: 5-variable Reverse Don’t Care condition puzzle. (11 Marks)
- [PYQ 2022]: Express Boolean function with 8 or fewer literals. (09 Marks)
- [PYQ 2017]: Show that . (10 Marks)