Thank god you made this! I swear there are teachers teaching boolean logic who do not understand or can explain what they are doing? Or simply miss step expecting everyone understands what they have done.
Mr. Pytel!! You do such a great job with these videos. You teaching style is clear and effective. This video in particular practically saved my semester!! Thank you so much Jake
It helps me a lot. Thank you so much for the clear and detailed explanation. I am new to this subject after I saw your video, I feel so comfortable. Could you please provide more videos with the different examples?
great presentation and had me chuckling throughout (saying i don't care in a very passive fashion gets funny after a while). You should make a video on logical equivalences, it would really help a fellow computer science major out.
Jake, Juan, omnia, Thanks for the kind words. Wanted to let you know I'm developing my own independent TH-cam channel. I've got a sample pack of lectures up right now. This channel is undergoing major development summer 2014 but periodic updates will occur between now and then. Subscribe to it if you're interesting in the updates. Long terms plans include a complete basic electronics series (DC, AC, 3 phase AC), control electronics, power electronics, hydraulics, renewable energy, and more! The website will redirect to the TH-cam channel for phase 1 of development. Enjoy!
It came to me. Might logic simplification rules apply to web application? Im more into programming at the time. If i'v just made a complete and complex web page with cms (in object oriented code in PHP), and then written it out in this logic scheme manner. Then could i simplify application patterns?
Exercise 3, the expression is as follows: (NOT A && NOT B && C ) || (NOT A && B &&C ) || ( A && NOT B && NOT C ) || ( A && NOT B &&C ) ||( A && B &&C ) The result professor Pytel got is: (A && NOT B) || ( NOT B && NOT C) || (B && C), which might be wrong. Checking the expression with WolframAlpha the result is: (A && NOT B ) || C Am I missing something here, or is the video solution wrong? Aside from that I would like to issue a big "THANK YOU" to Columbia George Community College and Jim Pytel for excellent lessons.
in expression number 7 how did he get "BD"? or did i mess up on writing the expression... i thought it was BCD instead of B(D+E) and that parenthesis after the E was a typo :c other than that i got all of them right on my exam :D
in EX3 i solved another terms together leading to this solution AB'C using the first and third term together and the second and fifth term together so does this mean by taking another way of simplifying the result may change?
+Yazeed Shaker I got the same answer I commuted A'B'C' and AB'C' and factored out the B'C' left me with B'C'(A'+A) = B'C' carried over to B'C'+BC+AB'C which means AB'C=x +Columbia Gorge Community College is this wrong?
+Yazeed Shaker I Also used ended up with this answer before I followed his method. I'm also unsure if it is correct or not. Can somebody please tell us?
I got this problem: not(a) not(b) not(c) not(d) + not(a) not(b) c d + a b not(c) not(d) What is the simplest answer for that? because I got not(c) not(d) + not(a) not(b) But the answer is not(c) not(d) + not(b) c
search google images for the "truth table for the exclusive OR gate". Then you might get it. Keep in mind the notation in this binary expression A'B + AB' =[NOTA]B OR A[NOTB]
1. simplify the Boolean expression using Boolean algebra:- a) AB+AC+BC=AB+AC B) (A'+BC)' (A'B'+ABC) 2. State De-morgans law prove the following using Boolean algebra theorem:- AB+AC+BC=AB+AC
Thank god you made this! I swear there are teachers teaching boolean logic who do not understand or can explain what they are doing? Or simply miss step expecting everyone understands what they have done.
this guy's voice is too sensual for math. he needs to start making audio books. like 50 shades of grey or something
You are organized....
And a wizard.
You were more helpful than my teacher
legend, "If you can't explain it simply, you don't understand it well enough." and you sir know it more than well
Mr. Pytel!! You do such a great job with these videos. You teaching style is clear and effective. This video in particular practically saved my semester!!
Thank you so much
Jake
Whoever you are, fucking thank you !
Very well done. Best explanation of boolean simplification I have found on the interwebs.
You're awesome, I wouldn't be getting through my digital systems class without these videos
I don't smoke sir. By the way, this is honestly the best video around for Boolean algebra!
Thank you Very much Mr.Jim Pytel.This helped me lot
Great video, thank you!!! I didn't know a lot of those rules, now it's much clearer!
Wish you were my digital electronics lecturer, lecturers shall follow the same teaching standards you apply, THANKS A LOT
Thank you so so so much. You're a great lecturer
This video helped a lot. Thanks for posting this! I should ace my test tomorrow for sure..
this video helped me SO SO SO much. THANK YOU Sir!!!
"Are you a wizard" was pretty accurate, sir! :) Thanks for the lesson.
Thank you Mr Pytel your videos help soo much!!!
It helps me a lot. Thank you so much for the clear and detailed explanation. I am new to this subject after I saw your video, I feel so comfortable. Could you please provide more videos with the different examples?
great presentation and had me chuckling throughout (saying i don't care in a very passive fashion gets funny after a while). You should make a video on logical equivalences, it would really help a fellow computer science major out.
Can't thank you enough, May God bless you.
Great Stuff Man . It's very helpful and appreciated . Got all last test right .So Happy . Really good work sharing , effective lessons
Thank youu Jim, veryy well explained !!
I love this guy!!! I knew this stuff can be fun, unlike my professor.
Thanks allot. These videos have helped allot with my Grade 12 et mid year
Thanks very much indeed for explaining clearly
very nice its awesome
You understand me the whole....very thankfull 2 u god bless u
Jake, Juan, omnia,
Thanks for the kind words. Wanted to let you know I'm developing my own independent TH-cam channel. I've got a sample pack of lectures up right now. This channel is undergoing major development summer 2014 but periodic updates will occur between now and then. Subscribe to it if you're interesting in the updates.
Long terms plans include a complete basic electronics series (DC, AC, 3 phase AC), control electronics, power electronics, hydraulics, renewable energy, and more! The website will redirect to the TH-cam channel for phase 1 of development. Enjoy!
really love this guy. His voice reminds me of Ira Glass
Wow!
This method is save lot of time!
Thanks
super helpful - thank you!
You explained this so much better then my prof. She cant explain how to do this and we have a test in 3 days on this.
You are a legend!!
Thank you so much for this video 😍
OMG that's so helpful !!!thank you so much!!!!!!!!!!
Thank god for this step by step video 😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀
Please correct me if I am wrong and a justification would be great.
At 28:00 , can we simplify the B'C' + BC to just 1 therefore getting just AB'?
Great Work !! :D
Thank You for this video it really helps ! :)
a wonderful explaining
for 3rd example i got X= AC+BC+B'C'.. Is that correct?
This helped me a lot.
you are great Sir .....
you are a Hero!
sir, how did you get # 2 and #4 :(
at 20.17 could you rearrange the expression so you group the first and third term together and as a result get A B' C as your answer???
Much better than my teacher
in ex3,i have different answers in diffrnt solutions
well that was really useful !
thank you sir
It came to me. Might logic simplification rules apply to web application? Im more into programming at the time. If i'v just made a complete and complex web page with cms (in object oriented code in PHP), and then written it out in this logic scheme manner. Then could i simplify application patterns?
im gonna need to try this out later..
Question number 7 at the end is a little confusing based on the extra parenthesis after the E term. Other than that, great video, extremely helpful!
Just realized that what I thought was a 'C' in BCD was actually B(D+E)... Nevermind.
how to simplyfy the boolean expression
Are you allowed to go F = A´ (B´C´ + BC) → F = A´(1) ??
Since A + A´ = 1
Exercise 3, the expression is as follows: (NOT A && NOT B && C ) || (NOT A && B &&C ) || ( A && NOT B && NOT C ) || ( A && NOT B &&C ) ||( A && B &&C )
The result professor Pytel got is: (A && NOT B) || ( NOT B && NOT C) || (B && C), which might be wrong.
Checking the expression with WolframAlpha the result is: (A && NOT B ) || C
Am I missing something here, or is the video solution wrong?
Aside from that I would like to issue a big "THANK YOU" to Columbia George Community College and Jim Pytel for excellent lessons.
u save me thx
How can A + ~AB = A + B? How do you get to that point?
in expression number 7 how did he get "BD"? or did i mess up on writing the expression... i thought it was BCD instead of B(D+E) and that parenthesis after the E was a typo :c other than that i got all of them right on my exam :D
yea that it's a parenthesis, i got the same prob to haha
in EX3 i solved another terms together leading to this solution AB'C
using the first and third term together
and the second and fifth term together
so does this mean by taking another way of simplifying the result may change?
+Yazeed Shaker I got the same answer I commuted A'B'C' and AB'C' and factored out the B'C' left me with B'C'(A'+A) = B'C' carried over to B'C'+BC+AB'C which means AB'C=x +Columbia Gorge Community College is this wrong?
+Yazeed Shaker I Also used ended up with this answer before I followed his method. I'm also unsure if it is correct or not. Can somebody please tell us?
wow, your awesome :)
nice
ak number ..
Can you prove A" = A ?
LIKED
good
can I write C+(AB) as CA+B using associative law. plz sir answer this question
Akilaisurima Perera
no u can't but u can (c+a)(c+b)
Number 11 A+A'B = A+B ? Can you prove it or simplify the equation. I am confused
lol, 100 push ups as penance you say.
LOL, who in the heck downvotes a video like this?
I got this problem:
not(a) not(b) not(c) not(d) + not(a) not(b) c d + a b not(c) not(d)
What is the simplest answer for that? because I got not(c) not(d) + not(a) not(b)
But the answer is not(c) not(d) + not(b) c
11:41 ;)
expression 7 gave me BD+E+D'F
In your number 11 law, isn't A+A'B = A XOR B???
+Daisy Lopez Only if it was AB' + A'B
could please xplain it ...i dont understand what u mean..
search google images for the "truth table for the exclusive OR gate". Then you might get it.
Keep in mind the notation in this binary expression
A'B + AB'
=[NOTA]B OR A[NOTB]
So the "Wizard" pictured in this video is not Jim Pytel? I don't believe the answer to question number 4 at the end of this video is correct.
thanks...but i think that the ans of ex7 is wrong and the right ans is B(D+E) ggggggggg
:)
-A'BC'D + AB'C'D + AB'CD' + A'BCD' = Y
If anyone could pls simplify this will save my life...
without the use of xor gates
1. simplify the Boolean expression using Boolean algebra:-
a) AB+AC+BC=AB+AC
B) (A'+BC)' (A'B'+ABC)
2. State De-morgans law prove the following using Boolean algebra theorem:-
AB+AC+BC=AB+AC