Home / Minimization Techniques – 1- 1

Minimization Techniques – 1- 1

1. The Boolean expression
$\dpi{80} Y=\bar{A}\bar{B}\bar{C}D+\bar{A}BC\bar{D}+A\bar{B}\bar{C}D+AB\bar{C}\bar{D}$
can be minimised to :

(a) A’B’C’D+A’BC’+AC’D
(b) A’B’C’D+BCD’+AB’C’D
(c) A’BCD’+B’C’D+AB’C’D
(d) A’BCD’+B’C’D+ABC’D’

Explanation
No answer description available for this question. Let us discuss.

2. In which function is each term known as min term :

(a) SOP
(b) POS
(c) Hybrid
(d) both SOP and POS

Explanation
No answer description available for this question. Let us discuss.

3. A karnaugh map with 4 variables has :

(a) 2 cells
(b) 4 cells
(c) 8 cells
(d) 16 cells

Explanation
No answer description available for this question. Let us discuss.

4. In a karnaugh map for an expression having ‘don’t care terms’ the don’t cares can be treated as :

(a) 0
(b) 1
(c) 1 or 0
(d) none of above

Explanation
No answer description available for this question. Let us discuss.

5. The function Y=AC+BD+EF is :

(a) POS
(b) SOP
(c) Hybrid
(d) None of above