edited by
1,347 views
2 votes
2 votes

let f =  Σ(5,6,13) and f1 = Σ(0,1,2,3,5,6,8,9,10,11,13)

and f= f1.f2',where f,f1,f2  are function of A,B,C,D

1) the number of possible expression for f2 is:_______???
2) minimal value of f² is:

a) A

b) A'+C

c) B'

d) none

edited by

1 Answer

Best answer
2 votes
2 votes

given f =  Σ(5,6,13) and f1 - Σ(0,1,2,3,5,6,8,9,10,11,13)

and  f = f1 . f2 '

and if we want f =  Σ(5,6,13)

Σ(5,6,13) = Σ(0,1,2,3,5,6,8,9,10,11,13) . { Σ(5,6,13) + d(max term of f1)

Σ(5,6,13) = Σ(0,1,2,3,5,6,8,9,10,11,13) . { Σ(5,6,13) + d(4,7,12,14,15) }

so f2 ' = Σ(5,6,13) + d(4,7,12,14,15)

then f2 = Σ(0,1,2,3,8,9,10,11) + d(4,7,12,14,15)

(on compliment don't care do not change)

 

 

So  f2 = B'

selected by

Related questions

0 votes
0 votes
2 answers
1
Bikram asked Sep 20, 2016
251 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
1 answer
2
Bikram asked Sep 20, 2016
150 views
What is minimum number of NAND gates required to implement a 2 input EX-OR gate without using any other logic gates?
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Bikram asked Sep 20, 2016
196 views
The minimum number of $T$ –gates required to implement the following function is$$F(w,x,y,z) = \sum m (0,1,2,4,7,8,9,10,12,15) $$