Solved Examples · Example 30
Q.Example 1: Simplify the Boolean expression and then draw the logic diagram using only basic gates.
Karnataka PUCTextbookLongImportance★★★★★est
74% · 119/160 Questions
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →[!TLDR]
Map the minterms and don't-cares, group two quads ( and ), OR them, and build the result from NOT + AND + OR gates: .
Plotting the map
Enter 1 for each minterm in , X for each don't-care in , and 0 elsewhere:
| 1 | 1 | 0 | X | |
| 1 | X | X | 0 | |
| 0 | 1 | 1 | 0 | |
| 0 | 0 | 0 | 0 |
Grouping
- Quad 1: rows and , columns and (minterms 0, 1, 4 and don't-care 5). and change; constants give .
- Quad 2: rows and , columns and (minterms 13, 15 and don't-cares 5, 7). and change; constants give .
ORing the two groups gives the simplified SOP .
Realising with basic gates (Figure 10.4.1) …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.