edited by
15,869 views
54 votes
54 votes

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 $\left(xy+xz'\right)$ 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"

 

 

  1. $(11, 9)$
  2. $(9, 13)$
  3. $(9, 10)$
  4. $(11,11)$
edited by

6 Answers

–2 votes
–2 votes

I am getting 9 pos and 9 sop..

And once I hv used a dont care as 0. Thn I havnt used the sam dont care as 1.

WHat's wrong??

Answer:

Related questions

65 votes
65 votes
9 answers
3
Kathleen asked Sep 17, 2014
17,931 views
The following is a scheme for floating point number representation using $16$ bits.Let $s, e,$ and $m$ be the numbers represented in binary in the sign, exponent, and man...
48 votes
48 votes
4 answers
4
Kathleen asked Sep 16, 2014
15,068 views
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is$\Theta(1)$$\Theta(\lo...