Q. 2.2: Simplify the following Boolean expressions to a minimum number of literals: (a) xy + xy' (b)

Q. 2.2: Simplify the following Boolean expressions to a minimum number of literals: (a) xy + xy' (b) (x + y)(x + y') (c) xyz + x'y + xyz' (d) (A + B)'(A' + B')' (e) xyz' + x'yz + xyz + x'yz' (f) (x + y + z')(x' + y' + z)


Please subscribe to my channel. Importance is given to making concepts easy.

Wish you success,
Dhiman Kakati
(let's learn together)

Assam,India,(x + y)(x + y'),xyz + x'y + xyz',(a+b+c')(a'b'+c),(A + B)'(A' + B')',(x + y + z')(x' + y' + z),xyz' + x'yz + xyz + x'yz',digital electronics,boolean algebra,computer organization,digital design,digital design book by morris mano,problem solution,gate 2020 preparation,gate 2020 ece preparation,gate 2020 ece lectures,gate 2020 ece syllabus,