Question 1

Solve the following expressions using K-map simplification method.

1) Z(A,B,C)= ∑(1,3,5,7)
2) F(P,Q,R,S)=∑(1,2,4,7,8,12,13,15)
3) F(A,B,C)=π(1,2,4,7)
4) F(A,B,C,D)=π(1,3,5,6,8,10,11,12,13)

Question 2
A Karnaugh map is nothing more than a special form of truth table, useful for reducing
logic functions into minimal Boolean expressions. The truth table for a specific three-
input logic circuit is shown below. Using K-map method compute a simplified Boolean
expression to realize the following logic function.

Question 3
A seven segment decoder is designed to drive a very common type of digital display
device. A set of LED (or LCD) segments are used to display the numerals 0 through 9
when input is given as a four-bit code:

(i) Draw the truth table to represent the behavior of this circuit. Note that a “1”
output should represents an active display segment, while a “0” output
represents an inactive segment.
(ii) Compute a simplified Boolean expression to realize the above logic function
using K-map method.