Tutorial 3
Tutorial 3
Tutorial 3
02/02/2023
1. Find both the min-term and max-term expansions of the following function:
f(A, B, C) = (A+B)C
2. A combinational circuit has 4-inputs (A,B,C,D) and one output Y. The output is 1 (logic HIGH) when
the decimal value of the binary input is an even natural number. The simplified SOP expression for
output is ________ (Use K-map)?
3. a. Provide the AND-OR implementation of a circuit, using minimum gates, that gives HIGH output
when the input is BCD equivalent of 5,7 or 9 and LOW otherwise.
b. Simplify the given Boolean function using K-map, and implement it using two-level NAND gate
circuits: F = ∑ m (0, 3, 5, 7, 11, 13) + ∑ d(4, 6, 14, 15) .
5. Solve the POS function of 5 variable K-map using the following expression
f(P,Q,R,S,T) = ∏M(0, 2, 4, 7, 8, 10, 12, 16, 18, 20, 23, 24, 25, 26, 27, 28)
Solutions
1. Find both the min-term and max-term expansions of the following function:
f(A, B, C) = (A+B)C
Ans. The output is 1 when the decimal value of the binary input is an even natural
number.
Even natural numbers [within 0 to 15] are = 2, 4, 6, 8, 10, 12, 14.
A’B’ 1
A’B 1 1
AB 1 1
A’B’ 1 1
A’B X 1 1 X
AB 1 X X
AB’ 1
F = BD + CD + A’C’D’
B
D
C F
D
A’
C’
D’
4. a. Find out if the following function is self-dual or not? F(A,B,C) = ∑m(1, 2, 4, 7)
Ans. F = ∑m(1,2,4,7) = A’B’C+A’BC’+AB’C’+ABC
Fd = (A’+B’+C)(A’+B+C’)(A+B’+C’)(A+B+C)
Fd = (AB’+A’B+C)(AB+A’B’+C’)
Fd = A’B’C+A’BC’+AB’C’+ABC
Fd = F
Yes, F is self dual.
b. Let f be a self-dual function of n variables, and let M be the number of inputs for which the function f is 1.
Calculate the value of M in terms of n.
Ans. A self dual function is a neutral function i.e. number of min-terms is equal to number of max-terms.
Total number of inputs for n variables = 2n.
Hence the number of min-terms = number of max-terms = 2n/2=2n-1.
Each input for which the function is 1 corresponds to a min-term, therefore M=2n-1.
5. Solve the POS function of 5 variable K-map using the following expression
f(P,Q,R,S,T) = ∏M(0, 2, 4, 7, 8, 10, 12, 16, 18, 20, 23, 24, 25, 26, 27, 28)
Ans.
Therefore the minimal expression of the given Boolean Function can be expressed as follows :
f(P,Q,R,S,T)= (S+T) (Q+R’+S’+T’) (R+T) (P’+Q’+R )