# GATE2003-45

6k views

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
5
I am getting 8 literals for SOP, top right most corner '1' can form a group of 4 with corners don't cares and remaining 1's forms a group of 2 so there are total of 2+3+3 literals for SOP. but answer given as (9,10).
1
you missed 1 one.
10

this is what i have done, plz tell me where i was wrong.

pink ink is for SOP = 2 + 3 + 3 = 8

blue ink is for POS = 2 + 2 + 2 + 3 = 9

0
Can we use the DONT CARE once included angain for grouping  ? Here d15 and d8 are grouped twice ? Is this possibe ?
–1
if dont care has been used in pos than can't be used in sop .

since if we used don't care for pos that meas we are considering don't care as 0's ..
2
@gabbar sir
"if dont care has been used in pos than can't be used in sop ." This statement creating so much confusions. Do you have any standard books or any proofs justifying the statement .
AFAIK There is no such restrictions for dont care . Like if we are using one in POS we can use the same for SOP
9
Same don't care can be used both in SOP and POS . Moreover , minimum number of literals is not necessarilly unique.Hence we can go for option c since (9,8) is not in the options.For reference  Chapter 3 "Simplification of boolean function" - Digital Logic and Computer Design by Morris Mano
6
The same dont care can be used is pos and sop. When dont cares are included both pos and sop might represent different class of functions. Its completely valid.

We will be getting  two different grouping..

Grouping $1: (9,8)$

GROUPING $2: (9,10)$

Both the grouping are correct representation of the function  $f(wxyz)$

PS: Some wrong beliefs about don't cares

1. "once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa"
2. "if don't care has been used in POS than can't be used in SOP"

Both these statements are wrong. Don't care simply means just don't care -- say we use don't care $d3$ for grouping $1$ in SOP we can use $d3$ for grouping 0 in POS. (The literals in SOP and POS may not be the same)

K-Map grouping is not unique. And the question says about minimal literals. So, the best answer would be (9,8) Since there is no option in GATE we can go with $(9,10)$ (the question setter might have missed Grouping 1)

edited
0
@arjun sir , could you pls verify my solution ?
0
very nice solution. thanx
0

Is it correct or in correct please clarify ..

0

@air1ankit

no.

SOP: $x'z'w+y'w'+xz'w'$

POS: $\left ( x+w+z \right )\left ( z'+w' \right )\left ( x'+w' \right )\left ( y'+z' \right )$

I am getting (9,8), 9 for POS and 8 for SOP.

3

once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa.

0
ok. Thanx..
1
@arjun Sir is this statement  true ?
"once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa"
6
No same don't care can be used both in SOP and POS . Moreover , minimum number of literals is not necessarilly unique.Hence we can go for option c since (9,8) is not in the options.For reference  Chapter 3 "implification of boolean function" - Digital Logic and Computer Design by Morris Mano
0
both are different function we can can use same dont care for both sop and pos .

@Bikram sir verify this pls
0
@Arjun sir

If these questions  come so should we answer

2)or should we refrain from answering such questions?

3)and also one more point, are marks awarded to all in such a situation or not?

POS

(z'+w')(y'+z')(x'+w')(x+y'+w)

9 literals

SOP:

y'w'+yw+xyz'+x'y'z'

10 literals

ans is c
0

@Pooja Palod We can write SOP using 8 literal as well:

y'w'+xyz'+x'z'w  which is minimal and even in question it is mentioned that "What are the minimum possible literal counts of the product-of-sum and sum-of-product representations".

so, Answer should be (9,8) as it is minimum possible.

@Arjun Sir please look this question.

Correct me if I am wrong.

–1 vote

I am getting 9 pos and 9 sop...

WHat's wrong??

I am getting C as answer

edited

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??

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

Why this resstriction?

## Related questions

1
6.7k views
Consider the ALU shown below. If the operands are in $2’s$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and – denote addition and subtraction respectively)? $A + B$, and $A – B$, but not $A + 1$ $A + B$, and $A + 1$, but not $A – B$ $A + B$, but not $A – B$ or $A + 1$ $A + B$, and $A – B$, and $A + 1$
A $\text{1-input}$, $\text{2-output}$ synchronous sequential circuit behaves as follows: Let $z_k, n_k$ denote the number of $0'$s and $1's$ respectively in initial k bits of the input $(z_k+n_k=k)$. The circuit outputs $00$ until one of the following conditions holds ... is $01$. What is the minimum number of states required in the state transition graph of the above circuit? $5$ $6$ $7$ $8$
The following is a scheme for floating point number representation using 16 bits. Bit Position 15 14 .... 9 8 ...... 0 s e m Sign Exponent Mantissa Let s, e, and m be the numbers represented in binary in the sign, exponent, and mantissa fields respectively. Then the ... maximum difference between two successive real numbers representable in this system? $2^{-40}$ $2^{-9}$ $2^{22}$ $2^{31}$
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(\log n)$ $\Theta(n)$ $\Theta(n^2)$