Consider the following statements : S₁: Boolean expressions and logic networks correspond to labeled acyclic digraphs.
Consider the following statements :
S₁: Boolean expressions and logic networks correspond to labeled acyclic digraphs.
S₂: Optimal Boolean expressions may not correspond to simplest networks.
S₃: 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?
Show answerHide answer
Correct answer: (D) S₁, S₂ and S₃
Explanation
S₁: Boolean expressions and logic networks correspond to labeled acyclic digraphs. S₂: Minimal expressions do not always give the simplest network. S₃: Greedy K-map grouping may not give an optimal expression. So S₁, S₂ and S₃ are all correct.