Gate CS-2003 Question Paper With Solutions

Q. 42 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-ofproduct
representations respectively of the function given by the following
karnaugh map?Here, denotes “don’t care”

Gate CS-2003 Question Paper With Solutions

(A) (11,9)

(B) (9,13)

(C) (9,10)

(D) (11,11)

Answer: (C)

Explanation:

Gate CS-2003 Question Paper With Solutions Gate CS-2003 Question Paper With Solutions Gate CS-2003 Question Paper With Solutions

Learn More:   Gate EE-2015-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here