Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

boolean algebra problem

Status
Not open for further replies.

u24c02

Advanced Member level 1
Joined
May 8, 2012
Messages
404
Helped
2
Reputation
4
Reaction score
2
Trophy points
1,298
Activity points
4,101
Hi.

I want to confirm the answer of this question's answer.

The boolean question is like this.
ab'+c

And my answer is ab'+c(a+b'+c);
But my book's answer is like this. ab'+c(a+b'+1);

What is the answer of the question? Am I do wrong?
 

Please explain how you arrived at your answer.
 

ab'+c
=(a+c)(b'+c)
=ab'+ac+cb'+cc
=ab'+c(a+b'+c)
 

hi,

in boolean function x.x=x.
so c.c =c
regards
 
Last edited:

Thanks, and
I'm trying to convert*SOP (Sum of Products) to POS (Product of Sums).

The question is like this.

ABC +AB'C'+AB'C+ABC'+A'B'C

I just want to know some technic how to convert SOP to POS? I got thus like this but I can't find any more.

ABC +AB'C'+AB'C+ABC'+A'B'C =A(BC+B'C'+B'C+BC')+A'B'C
=A(1+1)+A'B'C =A+A'B'C' ...

Would you please help me ? How to convert this?
 

@u24c02

For your first question :

There could also be something like this :

Code:
ab' + c
= ab' + c + ca + cb'  // from  a + ab = a
= ab' + c(a + b' + 1)
So basically the answer you are looking for isn't unique.

For the second question :

Apply DeMorgan's law :

Code:
F = ABC +AB'C'+AB'C+ABC'+A'B'C 

F' = A'B'C' + A'BC' + A'BC (the SOP of minterms not present in F)

F = (F')' = (A'B'C' + A'BC' + A'BC)'
I believe the rest you can work out yourself.
 

hi,
Thanks, and
I'm trying to convert*SOP (Sum of Products) to POS (Product of Sums).

The question is like this.

ABC +AB'C'+AB'C+ABC'+A'B'C

I just want to know some technic how to convert SOP to POS? I got thus like this but I can't find any more.

ABC +AB'C'+AB'C+ABC'+A'B'C =A(BC+B'C'+B'C+BC')+A'B'C
=A(1+1)+A'B'C

Would you please help me ? How to convert this?
After that apply the rule A+A'B = A+B

results
A+A'(B'C)=A+B'C

then apply the rule used in the #3 post

you will get (A+B')(A+C) which is in POS form.

regards
 

@u24c02

For your first question :

There could also be something like this :

Code:
ab' + c
= ab' + c + ca + cb'  // from  a + ab = a
= ab' + c(a + b' + 1)
So basically the answer you are looking for isn't unique.

For the second question :

Apply DeMorgan's law :

Code:
F = ABC +AB'C'+AB'C+ABC'+A'B'C 

F' = A'B'C' + A'BC' + A'BC (the SOP of minterms not present in F)

F = (F')' = (A'B'C' + A'BC' + A'BC)'
I believe the rest you can work out yourself.




Thanks , How can you find minterm and maxterm?
 

I'm afraid you'll have to figure that out for yourself. Any basic digital electronics book should have the details you need.

If you can't find a book I'm sure a simple Google search will yield all the answers regarding boolean algebra. :)
 

I get it
I will do that.
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top