Ch 6. Boolean Algebra and Combinatorial Circuits
Ch 6. Solutions
1. AND gate
3. 0
5. 1
7. [latex]K \cdot P[/latex]; 0
9. [latex]T + H[/latex]; 1
11. [latex](A \cdot B) + (A \cdot C) + (B \cdot C)[/latex]
13. [latex](A \cdot \bar{B}) + (\bar{A} \cdot B)[/latex]
15. (0, 1, 1), (1, 0, 1), (1, 1, 0), (1, 1, 1)
17. 0
19. 0
21. [latex]C \cdot \bar{O}[/latex]; 1
23. [latex]\bar{S} + \bar{T}[/latex]; 1
25. [latex]\bar{P} + \bar{B}[/latex]; 1
29. [latex](\bar{A} + \bar{B}) \cdot \bar{C}[/latex]
31. [latex]F(A, B) = A \cdot B[/latex]
33. 0
35. A
37. [latex]F(U, P, B) = U \cdot (P + B)[/latex]; 1
39. [latex]F(N, B) = N \cdot \bar{B}[/latex]; 1
41. No simplification needed
43. [latex]F(A, B) = (A \cdot \bar{B}) + (\bar{A} \cdot B)[/latex]
45. [latex]F(A, B, C) = (\bar{A} \cdot \bar{B} \cdot \bar{C}) + (A \cdot B \cdot C)[/latex]