Lab Assignment 5
Group 1
1. Simplify F(A, B, C) = Σ(0, 1, 3, 4, 6) using K-map.
2. Simplify F(A, B, C, D) = Σ(1, 2, 4, 5, 8, 9, 10, 14) using K-map and express in POS form.
3. Identify all prime and essential prime implicants for F(A, B, C, D) = Σ(0, 2, 3, 6, 8, 9, 11, 14).
4. Design a circuit that outputs 1 when exactly two inputs are 1 among A, B, C, D.
5. Find minimal SOP for F(A, B, C, D) = Σ(0, 1, 3, 5, 7, 8, 10, 14, 15).
6. Determine the essential prime implicants of F(A, B, C, D) = Σ(2, 3, 6, 7, 9, 10, 12, 14, 15).
7. Design a circuit that outputs 1 if A and C are equal and B = 1.
8. Simplify F(A, B, C) = Σ(0, 2, 4, 5, 7) using 3-variable K-map.
9. Determine prime implicants of F(A, B, C, D) = Σ(1, 4, 5, 7, 8, 9, 13, 15).
10. Design a 4-input circuit that outputs 1 when the number of 1s is odd.
11. Find minimal expression for F(A, B, C, D) = Σ(0, 1, 5, 7, 8, 9, 11, 15).
12. Design a circuit that outputs 1 when A·B’ + C·D = 1 (simplify and implement).
13. Determine the essential prime implicants for F(A, B, C, D) = Σ(0, 3, 5, 6, 9, 10, 12, 15).
14. Simplify F(A, B, C, D) = Σ(2, 3, 6, 7, 9, 11, 13, 15) using adjacency wrap-arounds.
15. Design a combinational circuit that outputs 1 when inputs form a binary number greater
than 10 (1010)
Group 2
16. Simplify F(A, B, C) = Σ(1, 3, 4, 6, 7) to minimal POS and SOP.
17. Identify prime and essential prime implicants for F(A, B, C, D) = Σ(0, 1, 3, 4, 6, 8, 9, 13, 15).
18. Design a circuit that outputs 1 when AB = CD (the 2-bit numbers are equal).
19. Simplify F(A, B, C, D) = Σ(1, 2, 5, 6, 8, 9, 11, 12, 15) and show groupings.
20. Determine essential prime implicants of F(A, B, C, D) = Σ(0, 3, 5, 7, 9, 10, 12, 14).
21. Design a circuit that outputs 1 when inputs represent an even binary number.
22. Simplify F(A, B, C) = Σ(0, 2, 3, 5, 6) using K-map and verify using Boolean algebra.
23. Design a circuit that outputs 1 if A and B differ but C and D are same.
24. Identify all prime and essential prime implicants for F(A, B, C, D) = Σ(2, 3, 4, 5, 10, 11, 12, 13).
25. Simplify F(A, B, C, D) = Σ(0, 2, 4, 5, 9, 11, 13, 15) into minimal SOP.
26. Design a circuit that outputs 1 if the number of 1s ≥ 3.
27. Determine prime implicants for F(A, B, C, D) = Σ(1, 3, 4, 6, 8, 10, 13, 14).
28. Simplify F(A, B, C, D) = Σ(0, 2, 6, 7, 8, 10, 14, 15) using largest possible groups.
29. Design a 4-bit comparator circuit that outputs 1 when A B > C D.
30. Identify essential prime implicants for F(A, B, C, D) = Σ(1, 5, 7, 9, 10, 11, 12, 14, 15)
Group 3
1. Simplify F(A, B, C, D) = Σ(0, 1, 3, 5, 7, 8, 10, 11, 14, 15) to minimal SOP.
2. Identify prime and essential prime implicants for F(A, B, C, D) = Σ(2, 3, 6, 7, 9, 10, 11, 13, 15).
3. Design a circuit that outputs 1 only when the binary number A B C D represents a prime
number (2, 3, 5, 7, 11, 13).
4. Simplify F(A, B, C, D) = Σ(1, 3, 5, 6, 8, 9, 12, 14) using adjacency across edges.
5. Identify essential prime implicants for F(A, B, C, D) = Σ(0, 2, 3, 5, 9, 10, 11, 12, 14).
6. Design a circuit that outputs 1 when A = 1 and the rest of the inputs form an even number.
7. Simplify F(A, B, C, D) = Σ(0, 4, 5, 7, 8, 9, 11, 13, 15) and verify with algebra.
8. Identify prime implicants for F(A, B, C, D) = Σ(0, 2, 4, 5, 7, 8, 9, 10, 15).
9. Design a circuit that outputs 1 when (A XOR B) = (C XOR D).
10. Simplify F(A, B, C, D) = Σ(1, 3, 4, 6, 9, 10, 11, 14) to both SOP and POS.
11. Identify essential prime implicants for F(A, B, C, D) = Σ(0, 1, 3, 4, 8, 9, 11, 12, 15).
12. Design a circuit that outputs 1 when inputs form a palindrome (ABCD = DCBA).
13. Simplify F(A, B, C, D) = Σ(2, 3, 4, 5, 9, 11, 13, 14) and mark redundant groupings.
14. Identify all prime implicants for F(A, B, C, D) = Σ(0, 2, 5, 6, 8, 9, 10, 15).
15. Design a circuit that outputs 1 when total number of 1s = 1 or 3 (odd parity) using minimal
gates.