@@patrickshenton769 hahaha dats a lie and u know it, there are whole historically black colleges in the USA take have a whole year of cs students(black)
@@patrickshenton769 WOW! Now that is what you call racist and prejudice and stereotype. I am from the Caribbean which is predominantly black. I happen to teach computer science at a college here. I have seen many blacks naturally master computer science and math in no time! Don't repeat your thoughts anywhere else because it makes you seem naive! Black people have been put down in making us think that we are no good. Then we realized that we can dominate or do well in sports and other areas with talent and the right support. Now we are branching out even more because we realize that the sky is our limit.
I was watching this from beginning and it is always helping me, you never know how tough is for CS student to study electronics subject but Neso made my life easier...
To understand better the truth table, write it in this form: Ci A B | Co S Then for example if you have something like 1 0 1, for Ci, A and B respectively, just add the amount of 1's, in this case, there are 2, and write that number in binary, so it's 1 0, for Co and S respectively.
We can reach the second equation of Co from the same K map equation. Co= AB + AC + BC Co= AB + AC(B+ B`) + BC(A + A`) Co= AB + ACB + ACB` + A`CB Co= C(AB` + A`B) + AB {As ,X + XY = X, Here X->AB, Y-> C, Therefore AB + ACB= AB } Co= AB + C(A xor B)
Thank youu soo much for this playlist😊 I was able to complete my syllabus just because of you✨ Very easy and to the point explanation of each topic😊 You're the best Keep it up!!!!
Checkboard configuration derivation (as given in previous video): Y = A'B'C + A'BC' + AB'C' + ABC = A'.(BC' + B'C) + A. ( B'C' + BC) = A'.(B XOR C) + A.(B XNOR C ) = A'.(B XOR C) + A.(B XOR C )' = (A XOR (B XOR C)) = A XOR B XOR C
There is an easy method to find the carry expression by using the standard K-Map procedure. Once we got the expression C = ab + bc +ca , then use the property -> ab = ab(c + c') and use this in all the three terms and combine them with others. It's quite a bit easy.
@@kushshukla6588 This might be a late reply, but to do this you need to apply it to all and expand them all. Here's how: C = ac + bc + ab C = ac(b+b') bc(a+a') + ab(c+c') C = acb + acb' + bca + bca' + abc + abc' C = abc + ab'c + abc + a'bc + abc + abc' group all the abc C = abc + ab'c + a'bc + abc" C = abc + abc' + ab'c +a'bc factor the ab and factor the c C = ab(c+c') + c(ab' + a'b) C = ab + c( a xor b) There you go
Because I guess professors well most of them get bored teaching the same stuff over and over. They grow impatient, they just want to quickly get over with it. Only some professors are passionate, they teach everything with the same enthusiasm as if they're teaching it for the first time.
For whom wonders the algebraic proof for finding Co, we just need to add another AB to the second equation. It turns out that AB+AB+A'BCi+AB'Ci We can combine the terms as follows : (AB + A'BCi) + (AB + AB'Ci) = B(A+A'Ci)+ A(B+B'Ci) = BA + BCi + AB+ACi = BCi + AB+ACi By the way, thank you for the tutorial
Hi Sir, thank you for these videos, they have really helped me in understanding combinational circuits. One question however, not sure if this is youtube's default mechanism, but the videos in the combinational circuits playlist seem to be in random order. As such, I find it slightly difficult to follow some videos due to a lack of contextual knowledge, only to realize that the supposed previous videos has been placed in the later part of the playlist. If its not too troublesome, could you indicate the order of the videos that should be watched? Meanwhile I'll try to watch them in the order that seems logical to me. Once again, thank you for your efforts!
that explanation for xor use in the Cout really saved me hours of confusion, I figured you should use an or gate if you wanted to simplify, but I guess it's just a difference in design principle
there are 2 possible expressions for Co: Co=AB+Ci(A+B) Co=AB+Ci(A XOR B) Looking at the Karnaugh maps it seems the 2nd expression would have the shortcoming of generating glitches, while the 1st expression would not and it's safer. Why is it chosen the 2nd expression ? Note: glitches are generated when the groups in Karnaugh maps do not overlap
If I understand everything correctly you do not need to do the last karnaugh map. It is still correct if you have: C_o = AB + C_i(A X+ B) (I used X+ for X or), but it is also correct if you have C_o = AB + C_i(A + B) and that is seen by using commutativity from C_o = BC_i + AB + AC_i. When you regroup the terms C_o = AB + BC_i + AC_i which is C_o = AB + C_i(A+B). In fact I would say that the Exclusive Or is technically incorrect since it implies that if A and B are both 1 then C_i = 1 then the result is 0 which is not true. Unless I've misunderstood something.
Therefore if the text says C_o = AB + C_i(A X+ B) it should be viewed as incorrect. That expanded is C_i AND (A XOR B) which is 1 AND (1 XOR 1) for the last line of the truth table C_o should be 1, and yet if you AND that expression it is 0.
I think actually it would still be okay because the AB covers the ABC_i, but AB + C_i(A+B) is no less correct. So correction to my statement it is incorrect.
Also if you take the circuit diagram for Full Adder it is the way you have it Explicitly. It is a simpler design when you are doing both sum and carry in the same circuit.
As a faster leaner 🎉 1+1 = 10 which means 0 is a Sum then 1 is Carry . 0+1 = 1 here the sum is 1 then the carry will be 0 1+1+1= 11 it means that 1 is a Sum and other 1 which remains is a carry . 💻💻💻
I think you make a mistake grouping items at karnough map Co=AB+Ci(A ex or B).Because if we take groups just like you show us ıts became something with C compliments
I have a question please reply this question. Question: How can we implement a full-adder circuit with a decoder and NAND gate ? The direct NAND gate should not be used but the NAND gate should be provided with OR gate.
You are great Sir. Bless you Alays. Stay Happy N Healthy. Greetings from Antartica 🤗🤗
i have an exam in less than 5 hours , this is a life saver . i hope it comes in the exam like this
Did it come in the exam like this ?
@@patrickshenton769 hahaha dats a lie and u know it, there are whole historically black colleges in the USA take have a whole year of cs students(black)
@@patrickshenton769 WOW! Now that is what you call racist and prejudice and stereotype. I am from the Caribbean which is predominantly black. I happen to teach computer science at a college here. I have seen many blacks naturally master computer science and math in no time! Don't repeat your thoughts anywhere else because it makes you seem naive! Black people have been put down in making us think that we are no good. Then we realized that we can dominate or do well in sports and other areas with talent and the right support. Now we are branching out even more because we realize that the sky is our limit.
@Frank Hyanze someone called?
@@patrickshenton769 Simple fact. You are stupid because of your prejudice. Like your beloved leader Trump.
so selflessly you post your lectures for free.....is so kind Thank you so much
Sir... I must say .. You are sooooooo kind... I watched many of your videos... They are so helpful... Thank you... Keep up the good work!
bro's saving lives 10 years later
I was watching this from beginning and it is always helping me, you never know how tough is for CS student to study electronics subject but Neso made my life easier...
since u r a cs student and so m i,do u know any good links to learn c++?
zac miller whatsapp me I'll guide u
Am a bio student ;) ✌
It's a little bit easy for CS student
Bro same here😂😂😂 m also cs student .!and this too tough to understand☹️..
To understand better the truth table, write it in this form:
Ci A B | Co S
Then for example if you have something like 1 0 1, for Ci, A and B respectively, just add the amount of 1's, in this case, there are 2, and write that number in binary, so it's 1 0, for Co and S respectively.
yo man thx
I have learnt more than what I learnt in class the entire year.Thank you man
We can reach the second equation of Co from the same K map equation.
Co= AB + AC + BC
Co= AB + AC(B+ B`) + BC(A + A`)
Co= AB + ACB + ACB` + A`CB
Co= C(AB` + A`B) + AB {As ,X + XY = X, Here X->AB, Y-> C, Therefore AB + ACB= AB }
Co= AB + C(A xor B)
damn
Damn
Thanks I was searching for this
Thanks a lot
But At step 3 I think 2ACB should come though anyway it will get cancel only
Thanks a lot
But At step 3 I think 2ACB should come though anyway it will get cancel only
Wish all profs explain things like you do . Thanks a lot from Kazakhstan
Welcome from india
Бота Д ij and then delete the message ki for this post helpful e
very nice !
Very clear voice with very neat and clean drawings, thank you sir!
life saver man may all the divinities bless you
I'm having an exam tomorrow and I can say it's so helpful, thanks professor, from kenya
Clear and thorough explanation, finally understood adders..thanks a lot..
+Neso Academy Your Digital electronics playlist is the most helpful thing i have found on youtube. And thats saying something. Thank you
if you understood then explain the circuit diagram
+Zeeshan Ahmad go through k-maps, they've used k-maps to build the circuit
Madhu Kashyap
I didn't understand that
Y the carry is taken as 1 when there is 2
actually this is a binary addition when it comes 1 1 it does not mean 2 it mean 0 and 1 where 1 is carry and 0 is sum
I have an exam in an hour and here I'm watching this.this is life saver
Thank youu soo much for this playlist😊
I was able to complete my syllabus just because of you✨
Very easy and to the point explanation of each topic😊
You're the best
Keep it up!!!!
Thank u for such amazing tutorial
Worth watching this video rather then attend one hour lecture. 👌
Going through this great information an hour before my exams 👏
Checkboard configuration derivation (as given in previous video):
Y = A'B'C + A'BC' + AB'C' + ABC = A'.(BC' + B'C) + A. ( B'C' + BC) = A'.(B XOR C) + A.(B XNOR C ) = A'.(B XOR C) + A.(B XOR C )' = (A XOR (B XOR C)) = A XOR B XOR C
Thankx brother...i needed that
big thanks rahul.....I really needed that
Thank you so much I was stuck in this concept 😭💕thank u for explaining so welll😊
Having exam tomorrow morning ...but this brought a smile coz its byhearted now😁
SIR I HAVE COMPLETED LECTURE 102 OUT OF 202. TREMENDOUS LECTURE AND THANKYOU FOR YOUR GUIDANCE !!
Concept cleared! Thanks Buddy🎉
You're the best man. All my digital lectures in Coventry university are explained better than my professor
this type of courses helped us a lot to understand the depth of subject thank you very much sir
thanks for this top quality and easy to understand lectures.
I am very much moved by your efforts. This has motivated me to teach others. Thank you!
3:25 my man teleported to the back of the room for a second
great channel....helped me a lot...next year i will tell fresher to watch neso acadmy...
There is an easy method to find the carry expression by using the standard K-Map procedure.
Once we got the expression C = ab + bc +ca , then use the property -> ab = ab(c + c') and use this in all the three terms and combine them with others. It's quite a bit easy.
thank you bro!
How?
@@kushshukla6588 This might be a late reply, but to do this you need to apply it to all and expand them all.
Here's how:
C = ac + bc + ab
C = ac(b+b') bc(a+a') + ab(c+c')
C = acb + acb' + bca + bca' + abc + abc'
C = abc + ab'c + abc + a'bc + abc + abc'
group all the abc
C = abc + ab'c + a'bc + abc"
C = abc + abc' + ab'c +a'bc
factor the ab and factor the c
C = ab(c+c') + c(ab' + a'b)
C = ab + c( a xor b)
There you go
@@sawazalz9764 bro ig they already graduated.
thank you very much 9:27 helped clear things up
The video has been 9 years old but its really helping me a lot❤
You got some sick skills man. Saved my finals!
Bro my exam is in 20 mins , im watching it now 💀
Us brother us
@@thegunnerprince8650 yaar raat mein konsa exam ho raha hai tera
Me too
Thanks a lot, these lectures are really really helpful.
Now time is 1 am ... Exam at 9 am..
🎃😺
Same here😂
Thank you for your explanation. I'm studying in UK.
Wow excellent explanation 🙏
Thank you for saving my life!!
Now it's piece of cake. Thanks
this channel is great and you have done an excellent job ,thank you
Where is part 1 of full adder?by the way why can’t professors explain things like him?videos are amazing.thank you so much
Because I guess professors well most of them get bored teaching the same stuff over and over. They grow impatient, they just want to quickly get over with it. Only some professors are passionate, they teach everything with the same enthusiasm as if they're teaching it for the first time.
They teach just for completinh course and getting salary
Time is 1 am and exam is 9 am at baze university abuja Nigeria😢
For whom wonders the algebraic proof for finding Co, we just need to add another AB to the second equation. It turns out that AB+AB+A'BCi+AB'Ci
We can combine the terms as follows : (AB + A'BCi) + (AB + AB'Ci) = B(A+A'Ci)+ A(B+B'Ci) = BA + BCi + AB+ACi = BCi + AB+ACi
By the way, thank you for the tutorial
thanks for the clarification 🙏
Greetings from Romania!! extraordinary explanations and video, thank you very much!
+Alex Balu Greu sa fii student la Poli fratemeleu.
Adevarat, dar merge treaba , mai cu indieni, mai cu tutoriale.:D
best explanation ever! Thanks a lot mate!
When neso said, you are very good at these things , meanwhile my errors.
2+3=6, 3*4=7
Thank's sir. From UMS'student
Clear in just 2m..Thank you..i have exam tomorrow
oh boi...me too😕
@@thidassankaja8039but i had a perfect exam😁😁
Which University?
wooooow amazing,...please which text book can you recommend for computer science
Thank you soooooo much for the video
Nice way of learning 😍
Hi Sir, thank you for these videos, they have really helped me in understanding combinational circuits. One question however, not sure if this is youtube's default mechanism, but the videos in the combinational circuits playlist seem to be in random order. As such, I find it slightly difficult to follow some videos due to a lack of contextual knowledge, only to realize that the supposed previous videos has been placed in the later part of the playlist. If its not too troublesome, could you indicate the order of the videos that should be watched? Meanwhile I'll try to watch them in the order that seems logical to me. Once again, thank you for your efforts!
what's the order that you found reasonable? pls indicate here. I have finals next week
Your video is so helpful Sir,keep it up😊
I will consider 3 input ex-or gate
that explanation for xor use in the Cout really saved me hours of confusion, I figured you should use an or gate if you wanted to simplify, but I guess it's just a difference in design principle
you are a life savior
even understood without sound verywell said 👌👌
Please post links to previous videos. It is difficult to find the videos
there are 2 possible expressions for Co:
Co=AB+Ci(A+B)
Co=AB+Ci(A XOR B)
Looking at the Karnaugh maps it seems the 2nd expression would have the shortcoming of generating glitches, while the 1st expression would not and it's safer.
Why is it chosen the 2nd expression ?
Note: glitches are generated when the groups in Karnaugh maps do not overlap
best conceptual teaching
Very helpful video so thankyou sir 🎉
Thank you so much , Sir❤
Very easy to follow, thank you for the lecture.
Hey! Just wanna ask, what are real life applications of full adder and how do you explain it?
Computer uses this method to do addition and stuff
If I understand everything correctly you do not need to do the last karnaugh map. It is still correct if you have: C_o = AB + C_i(A X+ B) (I used X+ for X or), but it is also correct if you have C_o = AB + C_i(A + B) and that is seen by using commutativity from C_o = BC_i + AB + AC_i. When you regroup the terms C_o = AB + BC_i + AC_i which is C_o = AB + C_i(A+B). In fact I would say that the Exclusive Or is technically incorrect since it implies that if A and B are both 1 then C_i = 1 then the result is 0 which is not true. Unless I've misunderstood something.
Therefore if the text says C_o = AB + C_i(A X+ B) it should be viewed as incorrect. That expanded is C_i AND (A XOR B) which is 1 AND (1 XOR 1) for the last line of the truth table C_o should be 1, and yet if you AND that expression it is 0.
I think actually it would still be okay because the AB covers the ABC_i, but AB + C_i(A+B) is no less correct. So correction to my statement it is incorrect.
Also if you take the circuit diagram for Full Adder it is the way you have it Explicitly. It is a simpler design when you are doing both sum and carry in the same circuit.
very well explained
for who does not understand anything, go to Digital Electronics playlist and go to binary operations (sum, substraction etc.).
Such a great explanation 🙏 helped a lot 🙂
Wonderful explanation. Thank you!
Tnx a lot sir....finally i got my basics cleard
hey how do.you design a 1 bit full adder using exnor gate and mux ? Please respond .....
As a faster leaner 🎉
1+1 = 10 which means 0 is a Sum then 1 is Carry .
0+1 = 1 here the sum is 1 then the carry will be 0
1+1+1= 11 it means that 1 is a Sum and other 1 which remains is a carry .
💻💻💻
nice, very basic and useful thx sir
Thank you, thank you, thank youuuuu!
How come you are counting up with the x, y, and carry in bit? What is the carry in used for? And where does it associate with the carry out?
I think you make a mistake grouping items at karnough map Co=AB+Ci(A ex or B).Because if we take groups just like you show us ıts became something with C compliments
I dont understand 9:38 - 10:08... Can someone explain me or suggest another video to understand that part? But otherwise I understand everything else.
basically remember that if it final result got 1+1 --> carry 1
Does the order of MSB and LSB in Kmap matter?
where is part one plz it is humble request plz add videos in sequence
from Egypt thank you sir
very informative
excuse me sir, can I know the flatform / app you are writing on ?
Thanks Sir ☺️☺️
The carry is (AB+AC+BC) in full adder by sop Rules.... Please give me answer. This question is correct ya not. 🙏🙏
They call it a "carry" without carefully defining it. That's why it's so hard to understand.
Brilliant tutor
I have a question please reply this question.
Question: How can we implement a full-adder circuit with a decoder and NAND gate ? The direct NAND gate should not be used but the NAND gate should be provided with OR gate.
ans at 10:12 is wrong, it should be = BCi' + A + AB
you are wrong bro
@@ClashWithAbhiYt both ans are correct, there are two approaches
The only reason why I watch this video is because I want to build a computer in Minecraft
very usefull vedio sir
really good presentation.. :) Good job..!!
Is this circuit of full adder is correct??
Good explanation sir 😍😄 u say decimal addition in this tutorial I cannot identify which tutorial u said that plz send me link sir
Please give clarity on check board configuration
full adder part 1 sir ??
What is the use of Carry in? Why can't we just take the inputs of X and y and add them
Hello sir i am a little bit confuse about the sum process how you bring S = A + B +C
through K map
see video number 96 in the playlisi
Full adder part 1 is not included in digital electronics playlist
What's the use of adder ? Where we see this