The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+21 votes
2.8k 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)
asked in Digital Logic by Veteran (69k points) | 2.8k views
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).
you missed 1 one.

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

Can we use the DONT CARE once included angain for grouping  ? Here d15 and d8 are grouped twice ? Is this possibe ?
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 ..
@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
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
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.

7 Answers

+35 votes
Best answer


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(xyzw)

( PS: There were  statements decribing dont cares in many of the comments

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

"  if dont care has been used in pos than can't be used in sop "

Both these statements are wrong . Don't care simply means just Dont care  , say we use dont 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 same )

K Map- 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)

answered by Veteran (24.4k points)
selected by
@arjun sir , could you pls verify my solution ?
very nice solution. thanx

Is it correct or in correct please clarify ..

+5 votes

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

answered by Junior (861 points)

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.

ok. Thanx..
@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"
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
both are different function we can can use same dont care for both sop and pos .

@Bikram sir verify this pls
@Arjun sir

If these questions  come so should we answer

1)the best nearest 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?

Please help. All seniors please help us in this muddle.. It would be a great help:)
+5 votes
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
answered by Veteran (34.3k points)

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

answered by Boss (8.4k points)
–2 votes
I am getting C as answer
answered by Loyal (2.8k points)
edited by
–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??

answered by Boss (8.4k points)
" once I hv used a dont care as 0. Thn I havnt used the sam dont care as 1."

Why this resstriction?
–4 votes
i am getting 11,11

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

sop=x'y'z'+yw+xz'w'+y'zw'
answered by Boss (5.1k points)
edited by
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,593 questions
40,128 answers
114,021 comments
38,389 users