The Karnaugh map method is very commonly used for the simplification of Boolean expressions, since no algebraic rules are applied in this method. It is simply a graphic method and provides systematic approach for getting the simplified Boolean expression (a) Draw the K–maps for the following Boolean function of four variables. F1(A,B,C,D), ∑(m2,m3,m4,m6,m7,m11,m14,m15) (ii)Minimize the following function using K – map and realize it with AND, OR & NOT logic gates. G (A,B,C,D) = ∑(0,1,2,5,8,10,11,14,15,)
The Karnaugh map method is very commonly used for the simplification of
Boolean expressions, since no algebraic rules are applied in this method. It is
simply a graphic method and provides systematic approach for getting the
simplified Boolean expression
(a) Draw the K–maps for the following Boolean function of four variables.
F1(A,B,C,D), ∑(m2,m3,m4,m6,m7,m11,m14,m15)
(ii)Minimize the following function using K – map and realize it with AND, OR &
NOT logic gates.
G (A,B,C,D) = ∑(0,1,2,5,8,10,11,14,15,)
(b) The entrance to a group of four flats has a tube light. The tube light is to be
switched ON and OFF independently by the tenants of the four flats using
switches located in their flats. Design a switching circuit to implement this
using:
(i) Exclusive – OR gates.
(ii) NAND gates only.
(c) Design a sequential logic circuit of a half adder using NOR gates only.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
