GATE | GATE-CS-2003 | Question 45

Last Updated :
Discuss
Comments
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" GATECS2009Q45

(11, 9)

(9, 13)

(9, 10)

(11, 11)

This question is part of this quiz :

Digital Logic & Number representation,GATE-CS-2003,Logic functions and Minimization
Tags:
Computer Organization and Architecture
GATE
Digital Logic
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy