So going through some exercises on understanding Boolean Algebra Q1 P*Q+P*(Q+S) (PQ)+P*(Q+S) Because P and Q are common factors they can be canceled out and the simplified statement is = P*(Q+S) Q2 is P+Q+P*(Q'+S) (P+Q+P)*(Q'+S) But this has got me confused as to how to simplify it further. I know that Q+Q' = 1 but Q*Q' = 0, but also Q*/+Q = Q. But i'm not sure how to start attacking it. Truth Table would be PQS | Equation 000 0 001 0 010 1 011 1 100 1 101 1 110 1 111 1 Q3 (R+S*T)*(R+S'*T) (R*R+R*S'+R*T)*(R*R+R*S+R*T) (R*S'+T)*(R*S+T) (R*0+T) (R+T) All are common factors so, R*R= R, S*S'= 0, T*T=T Simplified = (R+T) It looks wrong to me I think the answer is (R) but I cant tell where I went wrong. Is Q1 Correct and is someone able to help step by step to explain what I need to do to work with Q2 and Q3?
Q1: it's good, but you should show the step, PQ + PQ +PS , then the identity that allows you to say that PQ + PQ = PQ. Q2: Expand out your terms. You know that P = PB + PB', and that you can OR the same term as many times as you'd like, so expand theed terms to be able to cancel the other terms out. Let's see how far you get with that information. Q3: Your problem is in your first line, you've split up S*T and haven't done your distribution properly. If you had, say, A*B(B + A*B)), this would come out to, A*B*B + A*B*A*B. As an aside, you needn't write the AND operation as A*B, you can just write AB.
You've got a terminology problem. P and Q are not "common factors", per se, but rather PQ is a "repeated term" and the duplicate term can be removed. Then P becomes a common factor that can be factored out. So PQ + P(Q+S) PQ + PQ + PS PQ + PS P(Q+S) Another way to do the dance is to say that P is a common factor, which means you can factor it out, leaving you with Q as a repeated term that can be reduced: PQ + P(Q+S) P(Q+Q+S) P(Q+S) What is your basis for pulling in the first two terms and grouping them the way you did? Is 4+5+6(7+9) the same as (4+5+6)(7+9)? Your truth table is correct. Just be more careful with your boolean manipulations. Hint: What does [X + X(anything)] reduce to? How did you come up with your second line. Take it one step at a time. You are trying to combine a bunch of steps and getting lost along the way. Distribute things the same way you would in normal algebra. You are correct that the final answer is just R.
x+xy x1 + xy x(1+y) | (1+y=1) x1 | (x*1=x) x No they are different, I suppose I got thinking the wrong way about multiplication with brackets P+Q+P*(Q'+S) P+Q+PQ'+PS P(Q'+Q+S) | Q'+Q=1 P(Q+S(1)) | S*1=1 (P+Q) (R+S*T)*(R+S'*T) RR+RS'T+RR+RST R(S'T+ST) | S'T + ST = 1 R(1) | R*1=1 R hows does this look? I think its the NOTing of a Value thats messing me up, I know if you break the line change the sign, but because only 1 value is NOTted
Correct. Nope. You are being sloppy again. How did you go from P+Q+PQ'+PS to P(Q'+Q+S) ? There's no PQ term there! Again, you're being sloppy. (R+S*T)*(R+S'*T) Notice that the last two terms in each factor don't contain an R. Yet in your next line you have an R in every term. How does that happen? Slow down and do it step by step: (R+S*T)*(R+S'*T) Distribute the first over the second: (R+S*T)*R + (R+S*T)*S'*T Now distribute again R*R+S*T*R + R*S'*T + S*T*S'*T Now remove duplicates and reorder factors R + R*S*T + R*S'*T + S*S'*T Now factor out the R from the first three terms R(1 + S*T + S'*T) + S*S'*T R(1) + S*S'*T R + S*S'*T Now kill off the second term R + (S*S')*T R + (0)*T R See? Take it step by step. Learning engineering by memorizing "break the line change the sign" and similar sayings is a big part of the problem. If you take the time and effort to learn the fundamentals, then you don't have to memorize cute little slogans that substitute for comprehension. You'll understand WHAT DeMorgan's theorems are and WHAT they mean and HOW they work and it will simply become a part of the way you think.