Комментарии:
شكرًا
ОтветитьThank You Sir ❤
ОтветитьThanks sir understood very well
ОтветитьThank you for this straightforward explanation. In fact, gazing at the playlist this is a part of, the playlist is EXACTLY what I need. Now back to the game, “Turing Complete” to make some progress and start building my own CPU 😁 haha.
As a side note, it looks as if I’m not the only one who thinks you do a great job at teaching. You should consider making more content and growing the channel. Redoing this series and others with better video and audio now that it’s been 8 years would do a lot to get new people in since the content has already proven to be successful and a great help to many people. 4k recording is available on any new phone or tablet. Using an iPad with an Apple Pencil would be great. Not to mention you have great handwriting that’s pleasing to watch.
Good stuff!
How would i derive a logic circuit out of a truth table if i can use a max of 2 inputs for my gates?
ОтветитьWow... Just wow... Thank you so much for making it easy to understand.
ОтветитьThank you sir ❤️
Ответитьgod bless you sir.
ОтветитьWho is here in 2022 . Respect and love for you respected Sir from Pakistan
ОтветитьReally superb cool evolution
ОтветитьSuperb🚀
ОтветитьWhy does the 000 row has a 1 as the result?
ОтветитьK map please can you explain it
ОтветитьSir i need explaintion of kmap please
ОтветитьThank you so much for the video, helped me for my semester exam
ОтветитьViktor irl
ОтветитьShould've added a "for dummies" at the end, I didn't understand a thing and all the other tutorials are for circuits with two inputs
ОтветитьThanks for this man. Circuits literally hit me like a truck and this helped clear it up a bit
ОтветитьAs a programmer that has been working for 6 years, and never got any formal programming education. This has definitely helped me a lot. Not being able to search specifically for what I want and stumbling upon it is a better feeling than anything.
Thank you, my good sir.
Thank you very much sir....your tutorial is very useful
ОтветитьHow to you convert a SOP to a Boolean Expression though?
ОтветитьHow does one decide how to layout the given logic gates in x/y space after you reduce the gates? For more complicated circuits, this is where I get stuck.
Ответить7 years later and these are still the most reliable, best explanations on the entire internet. I feel like half my tuition money should go to you because my entire class comes here to learn what our teacher doesn't make clear. we all appreciate you so, so much!! thank you!!
ОтветитьOftentimes, I don't comment on videos; I enjoy reading others'. I skipped a 3-hour lecture on Digital Circuit Design in search for better explanation on online, and I will never regret it at all. Please continue to post more videos with your vivid explanation. Much love from Ghana....
ОтветитьCan you so much for this beautiful video I really appreciate
Ответитьyou are a legend mate, thanks
Ответитьthank you so much i had no idea what we were doing in uni, you are a life savour
ОтветитьVery helpful, thank you!!!!
ОтветитьSame for Pos right? just where there is And gate I will draw Or and where there is Or I will draw And
ОтветитьI don't know why teachers can't explain this easily?
ОтветитьI'm confused about the relationship between the expression and the truth table. For example, the third and fourth values down have 0 1 0 = 1. Now, maybe I'm missing something but, I thought the expression was XY + Z' so... shouldn't that be the same as 0 x 1 + 0 and shouldn't that equal 0 instead of 1... OH NVM! Pff, sorry, its Z' so its actually 0 1 1 = 1... OMG THIS STUFF IS MADE TO CONFUSE YOU! hahaha Great video btw! First one I found that actually made sense
ОтветитьThanq bro
ОтветитьYou are a great teacher. You speak very well and make it very easy to understand. Thank you for your help!
ОтветитьThank you dude, I was going to start crying over this lol
ОтветитьNice explained!!!👍
ОтветитьThis video is so blur nothing is displayed cleanly
ОтветитьYou are awesome! thank you!
ОтветитьCystal clear, thank you!
ОтветитьThis seriously answered the topic that my professor did not explain properly in our course in college this 4th quarter. Thank you very much, liked and subscribed.
ОтветитьI got here from a playlist about making computers within Minecraft and I have no clue what you mean when you say "z prime". Is it just yet another way of saying Not? Why is there yet another way of saying Not? I'm kind of getting tired of having to learn twelve hundred different naming conventions for the same thing.
ОтветитьA room has 3 switches (A,B and C) and 2 light bulbs (F and G). F can only be switched on if all 3 switches are on and G will be off if all 3 switches are on. switch A alone does not work for F. F can be on if a combination of 2 switches are on at the same time. C does not work for G. G can be on if a combination of 2 switches are on at the same time. 1. Draw the truth table to represent this scenario for both bulb F and Bulb G. 2. Write down the boolean expression from the truth table for Bulb F. 3. Write down the boolean expression from the truth table for Bulb G. 4. Draw the combinational logic circuit for both Bulb F and Bulb G. Do all this on paper. Once you are done, take a picture of your paper and upload the picture here.
ОтветитьThis is so clear! Thank you so much
Ответитьتستاهل لايك
ОтветитьThanksss
ОтветитьTHANK YOU! My professor insisted there was no "way" of doing this and you just "have to see" it. this helps so so much
ОтветитьLiterally its 4 am and i finally understand my assignment bc of this
Ответить👌👌👌👌
ОтветитьThank you. ❤❤
Ответитьthat makes it soo easier holy whatt
Ответить