# Morris Mano Edition 3 Exercise 3 Question 22 (Page No. 112-113)

87 views
Simplify the following boolean function F together with the don’t care condition d; then express the simplified function in the sum of minterms.

(a)$F(x,y,z)=\sum(0,1,2,4,5)$

$d(x,y,z)= \sum(3,6,7)$

(b) $F(A,B,C,D) = \sum(0,6,8,13,14)$

$d(A,B,C,D) = \sum(2,4,10)$

(C) $F(A,B,C,D) = \sum(1,3,5,7,9,15)$

$d(A,B,C,D)= \sum(4,6,12,13)$

## Related questions

1
191 views
Implement the following boolean function F together with the don’t-care conditions d using no more than two NOR gates. Assume both normal and the compliment inputs are available. F(A,B,C,D) = $\sum(0,1,2,9,11)$ $d(A,B,C,D) = \sum(8,10,14,15)$
2
327 views
A logic circuit implements the following Boolean function: F = A’C + AC’D’ it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.
1 vote
3
103 views
Draw the AND-OR gate implementation of the following function after simplifying it in (a) sum of products and (b) product of sums. F= (A,B,C,D) = $\sum (0,2,5,6,7,8,10)$