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.
Jimmy said:
1 decade ago
This answer is not correct. If maxterms are
0 =not A + not B + not C
2=not A + B + not C
3=A + not B + not C
Maybe it cud be A is not correct.So no answer.
0 =not A + not B + not C
2=not A + B + not C
3=A + not B + not C
Maybe it cud be A is not correct.So no answer.
Sneha said:
1 decade ago
By using k-map simplification technique we can find answer.
Vinay said:
1 decade ago
You are right @Sneha. K-map is best technique.
Saba said:
1 decade ago
Through the min terms is also effective.
Anuj said:
1 decade ago
In the addition expression of our original equation (Given one) there is no term of A bar / Not A.
So, check in the options by only A bar / Not A analysis means no tern can have A bar / Not A in it. This is only possible in option B.
So, check in the options by only A bar / Not A analysis means no tern can have A bar / Not A in it. This is only possible in option B.
Shivam said:
10 years ago
As @Priyanka said we are taking max term and according to that the answer is B but when I check I found A is answer according to the explanation.
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