summaryrefslogtreecommitdiff
path: root/3860/CH3/EX3.19/Ex3_19.txt
blob: 5ea43bf30028a54777e2ee21f8a05940d6fcd538 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
 
        a'b' a'b  ab   ab' 

 c'd'    1    1    1    1

 cd'              1    X 

 cd      1   1         1

 cd'         1    1    1

  From the map, high outputs are for 0,3,5,6,7,9,10,11,12,13,14

   0.   0.   0.   0.
   0.   0.   1.   0.
   0.   1.   0.   1.
   0.   1.   1.   0.
   0.   1.   1.   1.
   1.   0.   0.   1.
   1.   0.   1.   0.
   1.   0.   1.   1.
   1.   1.   0.   0.
   1.   1.   0.   1.
   1.   1.   1.   0.

  Evaluating expression from truth table and map 

!a'b'c' d'  +  a'b'c d'  +  a'bc'd  +  a'bc d'  +  a'bcd  +  ab'c'd  +  ab'c d'  +  ab'cd  +  abc' d'  +  abc'd  +  abc d'  !

 There are 32 different minimum solutions to the given problem. some of them are

 F = a'b'c'd' + a'cd + bc'd + ab'd + abc'+ acd'

 F = a'b'c'd' + a'cd + bc'd + abd' + bcd'+ ab'c

 F = a'b'c'd' + b'cd + a'bd + bcd'+ ab'c+ ab'd

 F = a'b'c'd' + abc' + a'bd + bcd'+ ab'c+ ab'd