Jake, Juan, omnia, Thanks for the kind words. Wanted to let you know I'm developing my own independent RU-vid 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 RU-vid channel for phase 1 of development. Enjoy!
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
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.
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.
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
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
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?
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?
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?
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