UGC-NET | UGC NET CS 2015 Jun – II | Question 6

Consider the following statements :
(a)Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(b)Optimal boolean expressions may not correspond to simplest networks.
(c)Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of these statement(s) is/are correct ?

(A) (a) only
(B) (b) only
(C) (a) and (b)
(D) (a), (b) and (c)


Answer: (D)

Explanation:

• Boolean expressions and logic networks correspond to labelled acyclic digraphs.Correct
• Optimal boolean expressions may not correspond to simplest networks.Correct
• Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.Correct

So, option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save