Digital Electronics - Boolean Algebra and Logic Simplification - Discussion
Discussion Forum : Boolean Algebra and Logic Simplification - General Questions (Q.No. 1)
1.
Convert the following SOP expression to an equivalent POS expression.
Discussion:
37 comments Page 2 of 4.
Gowthami asirayya said:
9 years ago
The sum of products into the product of sum that means we have to replace in the place of * with +.
Aditya Warnulkar said:
1 decade ago
Minterms are = 7, 4, 5, 6, 1.
Hence corresponding maxterms will be 0, 2, 3.
Therefore option B.
Hence corresponding maxterms will be 0, 2, 3.
Therefore option B.
Venkatesh said:
1 decade ago
Max terms:0 2 3
a b c->000:0,
a bbar c->010:2,
a bbar cbar->011:3.
a b c->000:0,
a bbar c->010:2,
a bbar cbar->011:3.
Ganesh Rathod said:
1 decade ago
SOP is complement of POS and vice-versa. So option B is the correct answer.
Ninthu said:
4 years ago
How did you get an answer?
I didn't understand. Anyone make it clear.
I didn't understand. Anyone make it clear.
(4)
Joseph said:
5 years ago
How did you get an answer?I didn't understand. Anyone make it clear.
(2)
Amol kool said:
10 years ago
Sop is not compliment of POS or vice versa both are similar.
Jahoor alam said:
1 decade ago
Please draw the three variable k map & give explanation.
Sneha said:
1 decade ago
By using k-map simplification technique we can find answer.
Mounika said:
1 decade ago
If sop is complement of pos then please explain that.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers