Boe-Ii Tutorial Sheet Ece/Eee/Cse
Boe-Ii Tutorial Sheet Ece/Eee/Cse
17. Write Boolean expressions and construct the truth tables describing the outputs of the circuits
described by the following logic diagrams.
23. Simplify the following Boolean function to a minimum number of literals
(a) xy + xy' [ x]
(b) (x + y)(x + y') [ x]
(c) xyz + x'y + xyz' [ y]
(d) (A + B)'(A' + B') [ 0]
(e) xyz' + x'yz + xyz + x'yz' [ y]
(f) ABC + A'B + ABC' [ B]
(g) (𝐴 + 𝐵 + 𝐶) + (𝐵 + 𝐶) [0]
(h) (A+B+C)(A+B) [A+B]
(i) 𝐴B(𝐷 + 𝐶𝐷) +B(A +𝐴CD) [B]
(j)𝑋𝑌 + 𝑋𝑌𝑍 + 𝑋(𝑌 + 𝑋𝑌) [0]
(k)𝐴𝐵𝐶 + 𝐴𝐵 + 𝐵𝐶 [𝐴𝐵 ]
(l) (B+BC)(B+𝐵C)(B+D) [B]
(m) 𝐴𝐵𝐶 + 𝐴𝐵 + 𝐴(𝐵 + 𝐴𝐵) [0]
24. prove the following Boolean function to a minimum number of literals
(a) x'yz + xz = z(x + y)
(b) (x + y)'(x' + y') =x'y'
(c) xy + x(wz + wz') = x(w + y)
(d) (BC' + A'D)(AB' + CD') = 0
(e) (x + y' + z')(x' + z') = z' + x