Boolean Algebra (Simplification?)

kazafz

New member
Joined
Mar 8, 2008
Messages
18
Hello there guys, hows everyone doing?

I currently got this question from my nephew asking me how to simplify a Boolean Algebra but I don't know how to, so I was just wondering if anyone could lend me a hand?

The Boolean Algebra is:

W = S . (p + r) . (q + r)

I thought about simpliying it but I only know how to simplify Sum-Of-Products expression and not Products-Of-Sums....so please, can anyone teach me so I can teach my nephew?

EDIT: I think I phrased the question wrong because there is also a table.

p q r S W=S . (p + r) . (q + r)
1 1 1 0 0
1 1 0 1 1
1 0 1 0 0
1 0 0 1 0
0 1 1 0 0
0 1 0 1 0
0 0 1 0 0
0 0 0 0 0

So what the question was asking was:

Develop a Boolean expression W in its simplest form.

So what I did was I found the row of inputs which gave the output (W) as "1" (The row that is bolded), then I put it in the Boolean form:

pqr's = W

then I'm stuck because I don't know how to simplify is using Boolean Algebra.
 
kazafz said:
can anyone teach me so I can teach my nephew?
Unfortunately, it is not reasonably feasible, within this environment, to provide the dozens (hundreds?) of pages of text and multiplied hours of classroom instruction you seek. Sorry! :oops:

Please have your nephew reply (or dictate a reply) showing his work and reasoning so far. Once the volunteers can "see" where he is having trouble, we can attempt to assist.

Please be complete. Thank you! :D

Eliz.
 
Top