hi all: wood love a hand with a bit of a harder q, not understanding it sáll S-O-P's (sum of Products)
@thomaster ur a genius at these...yeah?
@AccessDenied any ideas man...?
At the moment, no. I'm reading some stuff on the topic since I am not familiar with it. :)
First do the distributive property, right?
sorry @wio could u check my answers man? i think a) is AB + CD b) is ABD and c) is A + BD but im not that certain about part b)...
sorry, let me think it out for a moment.
are you using karnot?
a) is correct.
b) is correct.
sweet, cheers man
yeah, the tables
c) is also correct.
I'm doing it using boolean algebra. I'm a bit used to it. Want me to show you?
yes please, if u have time that'd be awesome thanks =D
Okay for first one: \[ \begin{split} AB+CD(A\overline{B}+CD) &= AB+CDA\overline{B}+CDCD\\ &= AB + CDA\overline{B}+CD\\ &= AB + CDA\overline{B}+CD1\\ &= AB + CD(A\overline{B} + 1)\\ &= AB + CD1\\ &= AB + CD \end{split} \]I am using \(1\) for true here.
You can always append \(1\) into any and group. You can always \(+0\) as well, where \(0\) is false.
ahhhhh, yes, i've seen this, these are from the ...was it 8 or 10 rules... from a few chapters back
To be honest, I all the lines with \(1\) I would normally do in my head in one step, but I wanted to show it explicitly to be clear.
yep that makes sense, and i've got the table of rules written down somewhere previousely, so cool man, thanks for that, i didn't know b4 that i could apply to this, i thought we had to use the other mmethod cheers @wio
\[ \begin{split} AB(\overline{B}\overline{C}+BD) &= AB\overline{B}\overline{C} + ABBD \\ &= ABBD \\ &= ABD \end{split} \]
In this case, any duplicates such as \(BB\) can be made into a single \(B\). Any terms with that exist with their not form, disappear, in this case \(B\overline B\).
sorry, can u explain where the NOT C disappeared to in that one? plz
\[ AB\overline B \overline C = A0\overline C = A0 = 0 \]
of course: 0 and anthing by 0 = 0
sweeeeeeet, cheers again @wio dude r u any good at explaining truth tables? next topic coming up is them, i've had a look, but just not getting how to go backwards from the numbers to the letters...
got an example?
well... to the *right* letters anyway ;D
if u cold talk me through a) dude, i'll see if i can hit b to d on my lonesum...?
What are you trying to do? Turn it into an expression?
yep, need to find the SOP (which i think means the expressions we were just doing above)... and the POS... which i have no idea what they are...?
okay so let's start with table a).
We ignore every row where \(x=0\).
ok
So the only rows that matter are 101|1, 110|1, 111|1
Now, for the row 101|1, what we have is A=1, B=0, C=1. Does that make sense?
We can write this as \(A\overline B C\). In other words, we write out the terms that are 1 normally, and we write out the ones that are 0 with a not.
yep so not A, not B, C = 1 A, not B, not C = 1 a, not B, c = 1 A,B,C = 1 ...yeah?
No
\(101\to A\overline B C\), \(110 \to AB\overline C\), and \(111\to ABC\)
ok... what about \[001\to \overline A \overline B C\] tho?
oh, that is true.
ok, so how do i make all of those into some sort of ABC sum ? add them all together or times them all together... or....?
is it just a matter of X = sum of the above ones u typed and the 1 that i typed...?
So you only translate the rows that have a 1, don't translate the rows with a 0.
Then you just sum up the translations
do we need to reduce from that? coz now i have: \[x = \overline A \overline BC + A \overline B \overline C + A \overline BC + ABC\]
Yeah. Reduce from that.
when you have a lot of terms, karnot maps are easier than algebra.
sooo... how does that reduce if it's "add"and not "times"...?
Well, for example with \[ A\overline BC + ABC = AC(B+\overline B) = AC1 = AC \]
It is easier to do it with karnot maps though.
no worries, look all good, cheers for your time and your help @wio i'm going to read the book again and see if it makes any more sense thanks bro
Join our real-time social learning platform and learn together with your friends!