271 views
0 votes
0 votes

Find the minimum sum of products form of the below Logic function :

$$F(A,B,C,D) = \sum m(0,2,8,10,15) + \sum d(3,11,12,14)$$

where $m$ and $d$ are min-terms and don’t care conditions respectively.

  1. $AC +\bar BC \bar D +B\bar C $
  2. $\bar B  \bar D  + AC$
  3. $\bar AC +BC+\bar B\bar C \bar D$
  4. $B\bar C\bar D + \bar BA + CA$

1 Answer

Best answer
1 votes
1 votes
  00 01 11 10
00 1   X 1
01        
11 X   1 X
10 1   X 1

We get 2 prime implicants,

$\bar B \bar D + AC$

selected by
Answer:

Related questions

0 votes
0 votes
0 answers
1
Bikram asked Sep 20, 2016
136 views
Latches constructed with NOR and NAND gates tend to remain in the latched condition due to which configuration feature?cross couplinggate impedancelow input voltagesasync...
0 votes
0 votes
2 answers
2
Bikram asked Sep 20, 2016
260 views
The minimum number of gates required to implement the Boolean function $(AB+C)$ if we have to use only 2-input NOR gate?
0 votes
0 votes
2 answers
3
Bikram asked Sep 20, 2016
300 views
Zero has only one representation inSign magnitude1's complement2's complementBoth 1's complement and 2's complement
3 votes
3 votes
1 answer
4
Bikram asked Sep 20, 2016
399 views
The number 3 in 2’s complement representation is00000011111111011111110001111100