search
Log In
0 votes
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)$
in Digital Logic 87 views

Please log in or register to answer this question.

Related questions

2 votes
1 answer
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)$
asked Apr 2, 2019 in Digital Logic ajaysoni1924 191 views
0 votes
1 answer
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.
asked Apr 2, 2019 in Digital Logic ajaysoni1924 327 views
1 vote
1 answer
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)$
asked Apr 1, 2019 in Digital Logic ajaysoni1924 103 views
0 votes
0 answers
4
82 views
Simplify the following boolean expressions into (1) Product of sums (2) sum of products. x’z’ + y’z’ + yz’ + xy AC’ + B’D + A’CD + ABCD (A’ + B’ + D’)(A + B’ + C’)(A’ + B + D’)(B + C’ + D’)
asked Apr 1, 2019 in Digital Logic ajaysoni1924 82 views
...