edited by
1,865 views
4 votes
4 votes

Consider the following statements:

  1. Boolean expressions and logic gates networks correspond to labelled acyclic digraphs
  2. Optimal boolean expressions may not correspond to simplest networks.
  3. 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?

  1. i only
  2. ii only
  3. i and ii
  4. i, ii, and iii
edited by

1 Answer

1 votes
1 votes

All are correct

answer D

Answer:

Related questions

0 votes
0 votes
4 answers
4
go_editor asked Jul 31, 2016
3,906 views
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...