# Morris Mano Edition 3 Exercise 3 Question 27 (Page No. 113)

0 votes
344 views
Simplify the Following boolean function by means of the tabulation method.

(a) P(A,B,C,D,E,F,G)=$\sum(20,28,52,60)$

(b) P(A,B,C,D,E,F,G)= $\sum(20,28,38,39,52,60,102,103,127)$

(C) P(A,B,C,D,E,F) = $\sum(6,9,13,18,19,25,27,29,41,45,57,61)$

0 votes
Ffffffffffffffff

Hhbbbbbbb

## Related questions

0 votes
0 answers
1
120 views
Simplify the boolean function F together with the don’t care conditions d in (1) sum of products and (2)product of sums. (A) $F(w,x,y,z) = \sum(0,1,2,3,7,8,10)$ $d(w,x,y,z) = \sum(5,6,11,15)$ (b) $F(A,B,C,D) = \sum (3,4,13,15)$ $d(A,B,C,D) =\sum(1,2,5,6,8,10,12,14)$
0 votes
0 answers
2
101 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)$
2 votes
1 answer
3
230 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)$
0 votes
1 answer
4
420 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.