GFG App
Open App
Browser
Continue

# GATE | GATE-CS-2015 (Set 2) | Question 47

The number of min-terms after minimizing the following Boolean expression is _________.

`      [Dâ€˛ + ABâ€˛ + Aâ€˛C + ACâ€˛D + Aâ€˛Câ€˛D]â€˛`

(A) 1
(B) 2
(C) 3
(D) 4

Explanation:

```Given Boolean expression is:
[Dâ€˛ + ABâ€˛ + Aâ€˛C + ACâ€˛D + Aâ€˛Câ€˛D]â€˛

Step 1 : [Dâ€˛ + ABâ€˛ + Aâ€˛C + Câ€˛D ( A + A')]â€˛
( taking C'D as common )

Step 2 : [Dâ€˛ + ABâ€˛ + Aâ€˛C + Câ€˛D]â€˛
( as, A + A' = 1 )

: [D' + DC' + AB' + A'C]' (Rearrange)

Step 3 : [D' + C' + AB' + A'C]'
( Rule of Duality, A + A'B = A + B )

: [D' + C' + CA' + AB']' (Rearrange)

Step 4 : [D' + C' + A' + AB']'
(Rule of Duality)

: [D' + C' + A' + AB']' (Rearrange)

Step 5 : [D' + C' + A' + B']'
(Rule of Duality)

:[( D' + C' )'.( A' + B')']
(Demorgan's law, (A + B)'=(A'. B'))

:[(D''.C'').( A''.B'')] (Demorgan's law)

:[(D.C).(A.B)] (Idempotent law, A'' = A)

: ABCD

Hence only 1 minterm after minimization. ```
My Personal Notes arrow_drop_up