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 3 of 4.
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.
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)
Saba said:
1 decade ago
Through the min terms is also effective.
Vinay said:
1 decade ago
You are right @Sneha. K-map is best technique.
Sneha said:
1 decade ago
By using k-map simplification technique we can find answer.
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)
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.
Shipra said:
1 decade ago
Nice answer vinod.
Dheeraj said:
1 decade ago
Ya Vinod is correct.
VINOD said:
1 decade ago
SHORT CUT :NO.OF COMBINATION POSSIBLE WITH 3 VARIABLE IS(01234567)
min terms of the abv eq is: 7,4,5,6,1
IN POS IS TAKING MAX TERMS :REMAINING NUMBERS IS =0,2,3
MIN TERM IS :1 IF U GET 0 IS COMPLIMENT USING METHOD IS :SOP
MAX TERM IS :0 IF U GET 1 IS COMPLEMENT USING METHOD IS :POS
min terms of the abv eq is: 7,4,5,6,1
IN POS IS TAKING MAX TERMS :REMAINING NUMBERS IS =0,2,3
MIN TERM IS :1 IF U GET 0 IS COMPLIMENT USING METHOD IS :SOP
MAX TERM IS :0 IF U GET 1 IS COMPLEMENT USING METHOD IS :POS
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers