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 4 of 4.
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.
Mounika said:
1 decade ago
If sop is complement of pos then please explain that.
Jahoor alam said:
1 decade ago
Please draw the three variable k map & give explanation.
Maha said:
1 decade ago
Draw a three variable k-map and plot the given SOP forms. The remaining boxes which are not filled will give the answer for POS form. But you have to inverse each variable for example A means Abar.
Ganesh Rathod said:
1 decade ago
SOP is complement of POS and vice-versa. So option B is the correct answer.
Rajasekhar said:
1 decade ago
How to find maxterms?
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.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers