1. Boolean expressions and logic networks corresponds to labelled a cyclic diagraphs
2. Optimal Boolean expressions may not corresponds to simplest network.
3. Choosing essential block first in a Karnaugh map and then Greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of the statement(s) is /are correct ?
A) 1 only B) 2 only C) 1 and 2 D) 1,2& 3.
Answer D
2. Optimal Boolean expressions may not corresponds to simplest network.
3. Choosing essential block first in a Karnaugh map and then Greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of the statement(s) is /are correct ?
A) 1 only B) 2 only C) 1 and 2 D) 1,2& 3.
Answer D
No comments:
Post a Comment
Note: only a member of this blog may post a comment.