The literal count of a boolean expression is the sum of the number of times…

PYQ GATE 2003

The literal count of a boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (xy + xz') is 4. What are the minimum possible literal counts of the product-of-sum and sum-of-product representations respectively of the function given by the following Karnaugh map ? Here, X denotes "don't care"

image.png

  1. A.

    (11, 9)

  2. B.

    (9, 13)

  3. C.

    (9, 8)

  4. D.

    (11, 11)

Attempted by 187 students.

Sign up free to check your answer

Sign up free

Explore the full course: Digital Electronics

Loading lesson…