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 1 of 4.
Pacheko said:
7 years ago
The correct answer is A + A'B'C.
(13)
Emmanuel Afriyie Owusu said:
8 years ago
When you find the maxterms corresponding to the question you will obtain ( 0,1,2,3,6) and when you do same for the possible answers.
A. (7,5,4)
B. (0,2,3)
C. (0,2,2)
D. (0,5,2)
The answer is B because it's the only one that satisfies the SOP values of the question.
A. (7,5,4)
B. (0,2,3)
C. (0,2,2)
D. (0,5,2)
The answer is B because it's the only one that satisfies the SOP values of the question.
(5)
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)
Kiran sharma said:
6 years ago
(A+B+C').(A+B'+C').(A+B'C)
(2)
Joseph said:
4 years ago
How did you get an answer?I didn't understand. Anyone make it clear.
(2)
Suneetha said:
7 years ago
Thanks for your answer @Vinod.
(2)
Priya said:
8 years ago
How to find maxterms?
(2)
Bryx said:
1 decade ago
F(A,B,C) = m7+m4+m5+m6+m1
= A'B'C' + AB'C' + AB'C + ABC' + A'B'C
F'(A,B,C)= m0 + m2 + m3
If we complement F', we get F;
F = (m0 + m2 + m3)'
By DeMorgan's Theorem;
F = (A'B'C')'(A'BC')'(A'BC)'
F = (A''+B''+C'')(A''+B'+C'')(A''+B'+C')
F = (A+B+C)(A+B'+C)(A+B'+C')
So answer is letter B.
= A'B'C' + AB'C' + AB'C + ABC' + A'B'C
F'(A,B,C)= m0 + m2 + m3
If we complement F', we get F;
F = (m0 + m2 + m3)'
By DeMorgan's Theorem;
F = (A'B'C')'(A'BC')'(A'BC)'
F = (A''+B''+C'')(A''+B'+C'')(A''+B'+C')
F = (A+B+C)(A+B'+C)(A+B'+C')
So answer is letter B.
(1)
Priyanka said:
1 decade ago
From the given sop we can find min terms they are:
Min terms = 1, 4, 5, 6, 7.
From the above, we can know that the sop & pos are compliments.
So Max terms = 0, 2, 3.
Then according to pos.
The answer is B.
There is no need of drawing k-map here because its take some extra time for that compared to this procedure.
Min terms = 1, 4, 5, 6, 7.
From the above, we can know that the sop & pos are compliments.
So Max terms = 0, 2, 3.
Then according to pos.
The answer is B.
There is no need of drawing k-map here because its take some extra time for that compared to this procedure.
(1)
Av reddy said:
6 years ago
How can I get an answer, I didn't understand.
(1)
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers