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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.