Logic Gate Expressions
This computer science video follows on from the video about combining logic gates. It covers how a logic gate diagram can be described with a Boolean expression. This includes how to come up with a valid expression for a given combination of logic gates and, conversely, how to draw a logic gate diagram for a given expression. The order of precedence of the logical operations NOT, AND and OR, and the importance of brackets, are also discussed. It was the British born mathematician George Boole who in the mid 19th century, long before digital computers were even dreamt of, first described complex logical arguments using algebraic expressions that could be manipulated and simplified. Almost 70 years later, the American mathematician and electrical engineer Claude Shannon, showed that ‘Boolean algebra’ could be applied to the design of switching circuits; circuits that effectively handled binary ones and zeros. It was the work of these men that laid the foundations for the invention of the modern digital computer, and this video will give you some insight into how their work came together. This video also sets the scene for learning the rules of Boolean algebra, a very powerful tool for computer circuit design.
Пікірлер: 233
by far the most underrated CS-related youtube channel. this video was nothing short of a masterpiece. keep it up!
@ComputerScienceLessons
6 жыл бұрын
Thanks for the kind comment.
@Wrtvrxgvcf55
6 жыл бұрын
cheers mate, it was well deserved
bless this video, simplified my EE class lecture in like 5 minutes!
Thank you so much! I was struggling on understanding how to draw the diagrams!
@ComputerScienceLessons
3 жыл бұрын
I am very happy to help :)KD
U made it so simple and its really understandable. thank you sir
I am so enjoying this series of videos. I can't thank you enough for these! Sending love and thanks from South Africa
@ComputerScienceLessons
3 жыл бұрын
I love comments like yours. Thank you :)KD
Thank you so much. There is virtually no cs content on youtube for gcse, especially on vb, but feel much more confident knowing about this channel.
@imho2278
2 жыл бұрын
Jim Pytel is a great help.
bruv you explained in 6 mins what I couldn't understand for a week man tysm!
thank u! my exam is in 2 hours and this helped me a lot
@ComputerScienceLessons
4 жыл бұрын
I hope it went well. :)KD
@samaramanavalan4037
4 жыл бұрын
@@ComputerScienceLessons yes it did! ty!!
Excellent Explanation.
amazing explination... this is very complex for someone with my style of learning, and you managed to explain it better than my college teacher who lilkely took me for an idiot because he didnt realise i dont learn like other people
@ComputerScienceLessons
3 жыл бұрын
Delighted to help Anthony. :)KD
This channel is so amazing thank you so much for this!
@ComputerScienceLessons
3 жыл бұрын
You are very welcome :)KD
thank you so much man this will help me in my topical test today. The video is so simple and easy to understand
@ComputerScienceLessons
2 жыл бұрын
I hope the test went well :)KD
This is such a great video. I finally understand Logic Gates ! Many thanks !
Awesome video! 👍
thankyou sooo much.. was strugling but now i understand soo well.. i dont think ill ever forget
tbh.... I need to download all of your videos because I'm afraid if something will happen to such treasure. I aid my self-study with your videos and it makes such a wonderful impact/experience, huge thank you! I really feel like you love what you are doing, and that shows in a way how you explain things... You are the third person on youtube that really knows what he is talking about, and I've seen so many.
@ComputerScienceLessons
4 жыл бұрын
You are very kind. :)KD
Thank you for all the effort and knowledge.
Amazing explanation, thank you!
An absolute master class, thank you
Hopefully, this tutorial will help me complete my HW assignment
i find many video and finally i got it what i want
@ComputerScienceLessons
3 жыл бұрын
Glad to help :)KD
this vid is so cool thank you made my computer science exam 10x times easier :) ty
Greatly helped!!
you made it so much easier for me!! thank you so much!!!
@ComputerScienceLessons
4 жыл бұрын
You are very welcome. Glad to help :)KD
Best teacher ever ..thanks
thank you. So helpful
Thank you. This is the best explanation I've seen around.
@ComputerScienceLessons
6 жыл бұрын
That's great to hear. Tnx :)
Wonderful explanation.
Excellent video 🏆 Easy to follow and I get it now! Thank you thank you
@ComputerScienceLessons
Жыл бұрын
You are most welcome. Delighted to help :)KD
This video is awesome. Thank you
@ComputerScienceLessons
Жыл бұрын
You are most welcome :)KD
THANK U, THIS VID HELPS ME TO UNDERSTAND THIS TOPIC
Great explanation. Thanks.
@ComputerScienceLessons
4 жыл бұрын
You're welcome :)KD
Such a life-saver!
wow! very nice explanation!
thank you so much this video helped me a lot ...
thank you so much for every thing. This helps me A LOT : )
@ComputerScienceLessons
4 жыл бұрын
You're welcome :)KD
Very useful,keep it up
Much love ❤ very helpful
great explanation easily understood
@ComputerScienceLessons
3 жыл бұрын
You're welcome :)KD
this is just so helpful, I'm glad to find your videoo, helps me with homework 💙💙💙
@ComputerScienceLessons
5 ай бұрын
Glad to help. :)KD
That's the way all tutorials should be made. Clear and fluent language, without breaks, all words fully understood and the fluent of speaking at the correct speed. None pauses, coughs or mistakes. Enough with all tutorials and courses, plenty of them highly paid, that we need a translator or subs in order to understand most of the words. Golden rule? If you cannot speak correct and understood English, prefer to make videos only to the mother tongue.
@ComputerScienceLessons
2 жыл бұрын
Thank you :)KD
Thank you so much man, helped a lot!
@ComputerScienceLessons
3 жыл бұрын
You are most welcome :)KD
It has really helped me a lot .tanx
Omg . Thankyou very much 😍😍😍
thanks, u r saving me, my exam is tomorrow and this helped me a lot
Thanks from your better information
thank you so much,this is on point keep up the good work
@ComputerScienceLessons
2 жыл бұрын
You're welcome. And thanks for commenting :)KD
thanks man. this really help me a lot. I subscribed
@ComputerScienceLessons
6 жыл бұрын
Tnx. :)
Thank you Sir, superb video.
@ComputerScienceLessons
3 жыл бұрын
You are very welcome :)KD
I aced it the whole computer paper.. Thank you for the 10 marks💪
Very Helpful for Revision! Subscribed! God Bless :)
@ComputerScienceLessons
2 жыл бұрын
Thank you :)KD
I loveeee logic gates and this helped me get entertained
Hi! Thank you so much for the great explanations. I'm studying for the National Olympiad in Informatics at my home country, your videos and their methodical approaches have helped me a lot to prepare me for the exams :D
@ComputerScienceLessons
2 жыл бұрын
You are very welcome. It's good to hear I have helped :)KD
thanks a lot. You made it hell lot of easier for me..
@ComputerScienceLessons
3 жыл бұрын
I'm delighted to help. :)KD
Thank you so much sir🤗this helped me a lot.....
@ComputerScienceLessons
2 жыл бұрын
You are very welcome :)KD
Thanks!
Wow man you are the best amongst the rest ,believe me .
@ComputerScienceLessons
6 жыл бұрын
:)
amazing, keep posting more videos
@ComputerScienceLessons
3 жыл бұрын
I will indeed :)KD
Thank you for this
@ComputerScienceLessons
2 жыл бұрын
You're welcome :)KD
Wow amazing sir Thanks
i hav an exam tmr ad was so nervous about this topic but this really helped tysm!
@ComputerScienceLessons
3 жыл бұрын
Delighted to help. Good luck :)KD
It's 2 different kinds of transistors inside that shunt the power in different directions.
thank you so much, very good!
@ComputerScienceLessons
4 ай бұрын
You're very welcome :)KD
You are the best!!!
@ComputerScienceLessons
3 жыл бұрын
Thank you so much :)KD
This is a very high quality lesson and I greatly appreciate it
Brilliant!!!!
@ComputerScienceLessons
6 жыл бұрын
Tnx URA*
Very good tutorial
@ComputerScienceLessons
2 ай бұрын
Thank you :)KD
i wish you were my teacher :(( thank you so much
Amazing video tysm!
@ComputerScienceLessons
3 жыл бұрын
You're most welcome :)KD
WOWWWWWWWW AWESOME.Thank you so much
@ComputerScienceLessons
6 жыл бұрын
If only you saw what I can see!
Thanks so much! saved me
Soooooo helpful
Thank you 🙏🏾
@ComputerScienceLessons
3 жыл бұрын
You are most welcome :)KD
Good explanation bro 👍🏽👌🏽
@ComputerScienceLessons
3 жыл бұрын
Tnx :)KD
Thank you so freaking much
@ComputerScienceLessons
4 жыл бұрын
You're freaking welcome :) KD
you can build a Or with And and Not gates and vice versa And with Not and Or Gates. Which I find absolutely amazing.
@ComputerScienceLessons
4 жыл бұрын
What amazes me is that George Boole worked all of this out in the 19th century, based in the work of Aristotle from about 350 BC. :)KD
Very helpful 👍🏻👍🏻
@ComputerScienceLessons
3 жыл бұрын
:)KD
This helped me alot i coulnt understand anything in school u r like a angle
@ramdanyvanistha2844
4 жыл бұрын
An*
Thank you
@ComputerScienceLessons
3 жыл бұрын
You are welcome :)KD
thank you so much
@ComputerScienceLessons
Жыл бұрын
You're welcome :)KD
Thankyou soo much ♥️
@ComputerScienceLessons
2 жыл бұрын
And thank you - You are most welcome :)KD
It's a clear explanation thank u. Can u solve some boolean identity to draw the circuit😊
@ComputerScienceLessons
4 жыл бұрын
Thanks for the comment. If you're interested, I have made a sequence of videos on Boolean algebra. :) KD
@py_yogesh_1435
4 жыл бұрын
@@ComputerScienceLessons where can i Look on to it? Do u send its name or web link please
that you very much
Sir, is it same as current syllabus? Btw I love how simplified you that much complex topic such a gem channel.
@ComputerScienceLessons
8 ай бұрын
The fundamental concepts have not changed since the 1950's. Some people use different symbols for the logical operations. I have used ^ for AND, v for NOT and ¬ for NOT because you can find them all on a keyboard. The fundamental concepts are universal, regardless of the syllabus you follow :)KD
Perfect
@ComputerScienceLessons
5 жыл бұрын
Too kind. Tnx. :)
Thank u so much!it helped me.😊
@ComputerScienceLessons
5 жыл бұрын
You are very welcome. Thanks for the comment.
explained so much better than my teacher
thanks man for this video. there is 8 valid expressions in 06:20 not 4
@ComputerScienceLessons
2 жыл бұрын
Indeed :)KD
wow this is really stupendious...l really understand now
@ComputerScienceLessons
2 жыл бұрын
Glad to help. :)KD
Wow thankyou sir
Please correct me if I'm wrong, but the logic circuit you drew from the Boolean expression Z=(A and B) and NOT B is incorrect. If B is high than the circuit will not have an output due to the NOT gate feeding the second AND gate. If B is low than the first gate will not have an output, which will cause the second gate to again have no output. B can not be high and low at the same time in an AND gate configuration.
@ComputerScienceLessons
6 жыл бұрын
Hi James. The logic gate diagram does indeed match the expression (the object of the exercise), but as you have quite correctly pointed out, the circuit is pretty much useless. Examination of the truth table reveals that the value of Z is always 0, which means the whole thing could replaced with a single wire carrying no voltage at all. A B NOT B Z 0 0 1 0 0 1 0 0 1 0 1 0 1 1 0 0 If you are interested, my videos on Karnaugh maps and Boolean algebra cover techniques for simplifying expressions and therefore the circuits they represent.
@HenryFanboy
6 жыл бұрын
I can revise my module in 1 day with all these videos if I put my self to it. That's how well made they have been so far for me. I would donate £5 if I pass. I left all my revision for last day and if this makes me pass..............
Super🙏
@ComputerScienceLessons
Жыл бұрын
Thank you :)KD
Thanx
@ComputerScienceLessons
2 жыл бұрын
You're welcome :)KD
U=Legend
Hey buddy! Thanks for all your videos so far. They are clear and easy to understand. By the way I can not find those about Boolean. Have you uploaded?
@ComputerScienceLessons
6 жыл бұрын
Hi Yanis Weng. Thanks for the feedback. :) I have recently uploaded a video on the laws of Boolean algebra and have only just put it into a playlist called Boolean Algebra. I have the second of three on Boolean algebra (simplifying complex expressions using the laws) almost ready to upload. There will be a third on using De-Morgan's theorem. Please watch this space. You might also want to take a look at my playlist on Karnaugh Maps which is closely related. kzread.info/head/PLTd6ceoshprcTJdg5AI6i2D2gZR5r8_Aw
thank you so much i had to do a test like 2 hours ago and this helped me so much 🫶
Where is the "love" button?
@ItsMangoTape
Ай бұрын
S U B S C R I B E
Thnku
Ist it also right if i would write b and (not a) instead of (not a) and b
@ComputerScienceLessons
Жыл бұрын
Yes it is. This is known as the commutative law of Boolean algebra. However, not(a and b) is something different. Furthermore not(b and a) is the same as not(a and b) :)KD
what would be the input if 2 end gate connected together to not gate?
@ComputerScienceLessons
3 жыл бұрын
Not sure what you mean?