What my lecturer could not make me understand easily, i just got the easiest lecturer that has made understood 100% for free. I'm grateful for this channel
I deeply appreciate that even this far into the lectures, you still go over the basic things like the k-maps instead of just assuming the viewer knows how to do it. It helps so much with conceptualization and I see almost nobody doing it, so thank you a ton.
You are actually working towards making our country developed by developing 1. the brains of so many students in digital electronics who cannot easily understand the concepts 2. mainly free of cost!. THANK YOU SIR.
This is one of the best UA-cam channels for studying digital electronics. It clears all my concepts and makes learning so easy. Good going Neso Academy!
not only digital electronics but all subjects whatever they have covered completely but some of their playlist are not completely free if they can make that free too then i don't think they have competitor in youtube at least for engineering student
Thanks to you, sir, I have cleared my internal examinations of Digital Electronics. Thank you very much. Shout out to Neso Academy! Keep up the good work.
I love you! Sir, you've managed to explain everything in such a simple and clear way, I'm so so grateful! Whatever takes my uni professor an hour to analyze (and confuse us even more), can be found in a ten minute video of yours. I vow to thee!!
Hello everyone :) i believe i how found the explanation to the confusion we are all sitting with. How do we get 0 and 1 as Qn in the truth table's two middle cases.? First, what we must understand is that Qn represents the value of Q in a Nand-SR flip flop. (Q bar) is not represented in this truth table example as it is not relevant in some sence. Next, we must for ourselves try to visualize the Q output. First, let's put: Clock = 1, S=0, R=1. through the first nand gate at the top, (in previous lecture) we take 1 and 0 as inputs and get the S* as 1. For clock and R as inputs we get 1,1 which is 0 (according to our nand-gate truth table. so now we have S* as 1 and R* as 0. If we try to remember the SR-latch walkthrough he did a couple of lectures ago, we know that whenever S is 1, then Q is automatically 0, and when putting that input into the bottom nand-gate with R* then we get 1. so now we have S = 0, and R = 1. However, as mentioned just before, Qn represents the Q, not Q complement. So Qn represnets the Q, which is 0. therefore we put the 0 into the truth table as the value of Qn. For the third case where S = 1 and R = 0, (clock is ofcourse 1) Then the top nand-gate resolves into 1*1 = 0 = S*, and the bottom nand-gate resolves into 1*0 = 1 = R*. so whenever Reset is 1, then (Q compliment) is 0. and when you use 0 as an input for the top NAND-gate with S* then you get 1.. Again, it is very important to remember that Qn represents Q in our Sr flip flop truth table in previous lecture, so (Q compliment ) which is 0, is not included. So basically if you sit down, draw out the SR flip flop sequential circuit with control input as clock, and take clock as 1, and try both: S = 0, R = 1 S = 1, R = 0 Then you will get Q as Q = 0, (Q Bar) = 1 Q = 1, (Q Bar) = 0 But Qn again represnets Q, so the answer for case two would be: Case 2: 0 Case 3: 1. I apologize if i said the same words too many times :) but i don't want to loose anyone :) on beforehand :) thank you :)
I have a sequential logic exam today and was looking for that EXACT explanation for hours. The learning materials for sequential logic nets, we got from our professor, listed an excitation table for RS-flipflops and other logic operators. But nobody ever mentioned what an excitation table actually was?! NOWHERE and I repeat NOWHERE on the web could I find an explanation. Even the English Wikipedia article on excitation tables gives an explanation in words as to how one gets to an excitation table that´s about two sentences long. Of course that didn´t help me. THIS is the shit. This is what I was searching for. I could hug and kiss this man. God bless him.
Thanks a lot for such a good explanation in such simple way.... thumbs up... your way of breaking the long lecture in to smaller pieces is really impressive and understandable..
I just realized that i have wasted money behind varsity .. Belongs full semester i didn't even understand anything but two days before of semester final exam i have completed my full course with the help of your video ..
First of all thank you so very much for this fantastic presentation. However I have 1 question left that is still puzzling me: why did you mark the invalid cases as "don't cares"?
it is so simple bro-that is invalid case-thus we can't determine the exact output for that case-but it should be of either 0 or 1-thus sir marked don't care
How did you give the value for Q(n+1) when the values of S and R are 0,1 and 1,0 as 0 And 1?? Thanks in Advance.Your Lectures are very Nice and Helping!!
As this is a NOR SR Flipflop, we know from NOR SR Flipflop truthtable, when clk=1, S=0, R=1, Q=1 So here Q+1= 1+1=0. Similarly incase of NOR SR Flipflop when clk=1, S=1, R=0, Q=0 so here Q+1= 0+1=1. [I guess Q and Qn are same thing, and Q' is neglected]
you can also add '0'..........Q(n+1) = S+ Qn.R' + 0 , ,,,,,,and use the property A.A'=0 and bring in all the possible eight combinations.....still it equals Q(n+1) only.......The thing here is to get a characteristic(Minimal SOP/POS) equation. Not to make Q(n+1) invalid.
@@harshachallagulla4321 I think you didnt get my comment. It is stated in the video that Q(n+1) = S + Qn.R' Now set S and R to 1. Then you get Q(n+1) = 1 + Qn0 = 1. But you expect Q(n+1) = X (invalid) - based on the original truth table. --- I think the answer to my question is, when S,R are 1, one doesn't care what the formula gives.
@@RahulMadhavan Exactly the thing is, when u minimise the Boolean equation using K-MAP, if at all there are any DONT CARES included in the groups, we by default consider it as 1 ( or 0 if we are writing in POS form). So it is never possible for a Truth Table with DONT CARES to give a Boolean Expression that results in DONT CARE when we substitute input values.....it will have to return either 1 or 0 depending on the type of representation.
Hi, Neso. Thank you for your clear and thorough videos. I have just one doubt: why are the invalid states from the characteristic table used as don't cares on the k-map? It's a question some watchers are asking.
Alexandre Soares da Silva Invalid case arises when output can be anything (0 or 1) and is not controlled by inputs. So it is a type of don't care condition only.
1:04 will be the remain ?? remain of what ? what is it exactly what you mean ? your explanation about Qn and Qn+1 somehow not all people understand sir, please explain throughly and deeply so we understand 0+0 is 0 or 1+1 is 2 sir. do not explain ?+? = ? we don't understand the '?' thank you sir.
Thank you so much first time i understood flip flop properly. I had hard time understanding flip flop throughout my engineering but finally i got everything. Just wanted to know why we made this different tables. What are there uses i have completed all the videos till now may be i will understand this in later videos and if not please answer. Thanks a lot
we can use the minterm formula to acquire a boolean expression for S and R. S=sum of minterm(1)+ Minterm 3 is a dontcare or we can construct a K map with Qn and Qn+1 , fill in the values for S and where we have dont care put a 1.S=Qn+1. Similarly for R=~Qn+1. If i am wrong someone please correct me!
This should be considered a public service. I'm so grateful for the work of this Channel.
Yes, friend he had nicely explained the concepts....
9 years old class still has the best quality ❤
Brother, you explain digital electronics as if you are the one that develop flipflops and latches.
What a great job!
What my lecturer could not make me understand easily, i just got the easiest lecturer that has made understood 100% for free. I'm grateful for this channel
I deeply appreciate that even this far into the lectures, you still go over the basic things like the k-maps instead of just assuming the viewer knows how to do it. It helps so much with conceptualization and I see almost nobody doing it, so thank you a ton.
You are actually working towards making our country developed by developing 1. the brains of so many students in digital electronics who cannot easily understand the concepts 2. mainly free of cost!. THANK YOU SIR.
Yes, he had nicely explained the concepts....
This is one of the best UA-cam channels for studying digital electronics. It clears all my concepts and makes learning so easy. Good going Neso Academy!
Yes, he had nicely explained the concepts...so you are absolutely right.....
not only digital electronics but all subjects whatever they have covered completely but some of their playlist are not completely free if they can make that free too then i don't think they have competitor in youtube at least for engineering student
Thanks to you, sir, I have cleared my internal examinations of Digital Electronics. Thank you very much. Shout out to Neso Academy! Keep up the good work.
Yes, friend he had nicely explained the concepts....
I love you! Sir, you've managed to explain everything in such a simple and clear way, I'm so so grateful! Whatever takes my uni professor an hour to analyze (and confuse us even more), can be found in a ten minute video of yours. I vow to thee!!
Hello ....??
I declare u the next recipient for noble prize
Yes, friend he had nicely explained the concepts....
😂
PLEASE MAKE VIDEOS ON DIGITAL LOGIC FAMILIES (TTL, ECL, CMOS etc) and ADC and DAC conversions.
Your lectures are great.
Thank you so much for them.
Hello everyone :) i believe i how found the explanation to the confusion we are all sitting with.
How do we get 0 and 1 as Qn in the truth table's two middle cases.?
First, what we must understand is that Qn represents the value of Q in a Nand-SR flip flop.
(Q bar) is not represented in this truth table example as it is not relevant in some sence.
Next, we must for ourselves try to visualize the Q output.
First, let's put:
Clock = 1, S=0, R=1.
through the first nand gate at the top, (in previous lecture) we take 1 and 0 as inputs and get the S* as 1.
For clock and R as inputs we get 1,1 which is 0 (according to our nand-gate truth table.
so now we have S* as 1 and R* as 0.
If we try to remember the SR-latch walkthrough he did a couple of lectures ago,
we know that whenever S is 1, then Q is automatically 0, and when putting that input into the bottom nand-gate with R* then we get 1. so now we have S = 0, and R = 1.
However, as mentioned just before, Qn represents the Q, not Q complement.
So Qn represnets the Q, which is 0. therefore we put the 0 into the truth table as the value of Qn.
For the third case where S = 1 and R = 0, (clock is ofcourse 1)
Then the top nand-gate resolves into 1*1 = 0 = S*, and the bottom nand-gate resolves into
1*0 = 1 = R*. so whenever Reset is 1, then (Q compliment) is 0. and when you use 0 as an input for the top NAND-gate with S* then you get 1..
Again, it is very important to remember that Qn represents Q in our Sr flip flop truth table in previous lecture, so (Q compliment ) which is 0, is not included.
So basically if you sit down, draw out the SR flip flop sequential circuit with control input as clock, and take clock as 1, and try both:
S = 0, R = 1
S = 1, R = 0
Then you will get Q as
Q = 0, (Q Bar) = 1
Q = 1, (Q Bar) = 0
But Qn again represnets Q, so the answer for case two would be:
Case 2: 0
Case 3: 1.
I apologize if i said the same words too many times :) but i don't want to loose anyone :)
on beforehand :) thank you :)
thaks dude
Thanks in some words just ignore q bar right,and just compare the 3rd case for not used
so basically Q = Qn
Sir Q is present state but Q(n+1) is next state so how Q=Q(n+1) ?
Thanks Buddy!!
I have a sequential logic exam today and was looking for that EXACT explanation for hours. The learning materials for sequential logic nets, we got from our professor, listed an excitation table for RS-flipflops and other logic operators. But nobody ever mentioned what an excitation table actually was?! NOWHERE and I repeat NOWHERE on the web could I find an explanation. Even the English Wikipedia article on excitation tables gives an explanation in words as to how one gets to an excitation table that´s about two sentences long. Of course that didn´t help me.
THIS is the shit. This is what I was searching for. I could hug and kiss this man. God bless him.
Yes really nice explanation......
Each video so far was above average educational quality.
Concise and right length.
Thx
Absolutely right....
You a life saver brother you know that right?
Thanks a lot for such a good explanation in such simple way.... thumbs up... your way of breaking the long lecture in to smaller pieces is really impressive and understandable..
Thank You So much for such a great and simple lecture. It's sequential way of teaching which is very easy to understand.
awesome explanation sir...now I am able to draw flipflops and its table on my own...THANK YOU...
thankuuu so much.❤..mam ne krwaya tha class me pr mai bhul gyi thi..and u remind me the whole again..thankuu..your explanation is really good😊😊
Yes, friend he had nicely explained the concepts....
Tomorrrow is my exam! And this helped me alot ... Thanku very much 😋
Explanations are clear, pedagogy is top notch thanks from France =)
Absolutely correct.....
You are the Leonard for Logic Design subject.
value of s= Qn+1
value of r = Qn+1 bar ...using 4 cells k map
Sir the teaching is so so amazing keep goin like this I really enjoyed learning this way thank u so very much it helped my exams 😊🙏
Roll number in username 👁️👄👁️
Dear, don't put your Roll no in your username. Chances of it getting manhandling increases
its 2020 ,these lectures were posted 5 years ago, but still help full. may God Bless You.
Check out 2024 - it's still saving lives
Great stuff thank you. If anyone is having issues, look at the previous videos. Does a great job explaining everything
Yes his videos are really helpful
I just realized that i have wasted money behind varsity .. Belongs full semester i didn't even understand anything but two days before of semester final exam i have completed my full course with the help of your video ..
Given Rs 50 via UPI , a small contribution for the great service u do , y'all should do same !
I am watching this video at 1:12 am
and I have my semester exam at 9:00 am. God help me and bless this man
This chanel not only provides digital electronics but its also provides the best lectures of engineering subjects
Well done👏👏
Neso is god of digital electronics
A saviour have born to slay .. Slay this mighty subject 🔥🔥🔥
i literally love youuuuu sooo much.thanks for making concepts this easyyyy
thanks alot sir , your lectures are life savor :): ))
I'm watching this at 12:06a.m. because i couldn't understand the class at all. Thank you Indian guy
Yes, friend he had nicely explained the concepts....He is an indian?
Thank you sir 🙏 All videos are very helpful and very well presented 🙏🙏
Best teacher for Digital electronics
Absolutely right....
Thank you so much bro❤❤❤🎉
this guy xplain it way simplier 👍🏻👍🏻👍🏻
Very helpful. Love you for these tutorials. Thank you
Neso Academy.. Oh Thank you so much... I understand it very clearly.... Thank you ...
Thank you sir for excitation table🙏🙏🙏
Really puzzle breaking tutorial for me on these concepts. very nice.
Yes, friend his explanation is really helpful
I am studying every subject form this channel.
That was very helpful. sir. excellent explanation.
Thanks a lot due to this i can understand very easily
Thaaaaaaaku so much sir kitta bhi thanks bolu kaam h apke liye to
Yes, really nice video.....
Thank you
Neso Academy.
This should be considered a public service
oh man this channel is so helpful!!!
Yes, friend he had nicely explained the concepts....
Very good explanation so easy to understand thanx for this video👍
Yes really nice videos and nice explanation....
great work sir!!!
I truly respect u...!
Thank you very much sir🥳🥳🥳🥳
Neso academy you're the best
Thank you so much, you're doing a really instrumental work for students
Yes, friend he had nicely explained the concepts....
very good videos. ...it helped me lot to score good in exams. thanks! !!
+Jaya Sharma Mumbai university???
no
no
*awkward*
well explained thank you so much👍👍
Great teaching ❣️
Thank you for the lesson.
nice one !! help me to understand more about this chapter for my final exam...
Thank You Sir 🙏🤲❤️
You are the best!
Yes absolutely right....
Thanks Maya ❤️👍
Maya?
Best video 👍👍👍👍👍👍👍👍👍
OMG! Great lecture.
Yes, friend he had nicely explained the concepts....
Good presentation 👍...i really got it
Very nice explanation
Very clear explanation...
Thank you Neso
Thank you 🛐
AMAZING 😍. SO THANKFUL 😇
I guess this charateristics table is When we used NOR gate, right??
as u said when s=r=0 then memory
Nice job....
Very helpful 😊
Did you really got this lecture ??
@@alfinashaik7931 yeah I've studied this topic in my school...i watched this video just for clearing some confusions.
top quality teaching
Exactly....
really its so clear explanation, you are the best tauter
Thank u so much.. U r an amazing teacher
Thank you for teaching me this course
Yes, friend his explanation is really helpful
when calculating the value of S by K-mapping will we consider R too with it? so there will be 3 varibles Qn, Qn+1 and R or do we only take Qn and Qn+1
First of all thank you so very much for this fantastic presentation. However I have 1 question left that is still puzzling me: why did you mark the invalid cases as "don't cares"?
same question
it is so simple bro-that is invalid case-thus we can't determine the exact output for that case-but it should be of either 0 or 1-thus sir marked don't care
Hello sir, you are explaining very well but I just don't the part from k-map 7:10 plz help or suggest something to me. Thank you!
How did you give the value for Q(n+1) when the values of S and R are 0,1 and 1,0 as 0 And 1?? Thanks in Advance.Your Lectures are very Nice and Helping!!
Yeah that's what I also wanna know !!
@@spacepacehut3265 and did you get it?
@@spacepacehut3265 Same here. If you know kindly tell me too
As this is a NOR SR Flipflop, we know from NOR SR Flipflop truthtable, when clk=1, S=0, R=1, Q=1 So here Q+1= 1+1=0. Similarly incase of NOR SR Flipflop when clk=1, S=1, R=0, Q=0 so here Q+1= 0+1=1.
[I guess Q and Qn are same thing, and Q' is neglected]
Excellent explaination
i am watching this video a day before semester exam and i have the whole syllabus to cover..... whole!!!!
Oh my god....
Best best no word sir💖
Yes, friend his explanation is really helpful
your are the best explainer
great ......... u save my day sir
Thank uhhhhh so much sir 🙏🙏
In the truth table,how value of Q(n+1) become 0,1?Can you please clarify
That's because we find Q or Q(n+1) using set and reset values .
@@sravanikatasani6502 just tell me that....if Q=0 and Q'=1 then why we write 0 as Q(n+1) ??
@@yogeshmourya981 it depends on the inputs s and r. If both are 0 then it will be"no change" means previous state will be printed as present state
@@mahabirneogy7195 thanks brother 🙂
Sir, can you please tell me, when S=0 , R=1 & S=1 , R=0 , How did we get the values of Qn+1 as 0 and 1 respectively.
same doubt he skipped that part
At 8:05: Q(n+1) = S + Qn.R' = S (R + R') + Qn. R' = S.R + S.R' + QnR'. But S.R leads to invalid state?
you can also add '0'..........Q(n+1) = S+ Qn.R' + 0 , ,,,,,,and use the property A.A'=0 and bring in all the possible eight combinations.....still it equals Q(n+1) only.......The thing here is to get a characteristic(Minimal SOP/POS) equation. Not to make Q(n+1) invalid.
@@harshachallagulla4321 I think you didnt get my comment.
It is stated in the video that Q(n+1) = S + Qn.R'
Now set S and R to 1. Then you get Q(n+1) = 1 + Qn0 = 1.
But you expect Q(n+1) = X (invalid) - based on the original truth table.
---
I think the answer to my question is, when S,R are 1, one doesn't care what the formula gives.
@@RahulMadhavan Exactly the thing is, when u minimise the Boolean equation using K-MAP, if at all there are any DONT CARES included in the groups, we by default consider it as 1 ( or 0 if we are writing in POS form). So it is never possible for a Truth Table with DONT CARES to give a Boolean Expression that results in DONT CARE when we substitute input values.....it will have to return either 1 or 0 depending on the type of representation.
Very helpful channel .
Yes, friend really helpful
do you have any lecture on Analog designs?
how values of Qn+1 come in truth table please explain?
check the present state and input of s and R then value come in truth table
Hi, Neso. Thank you for your clear and thorough videos.
I have just one doubt: why are the invalid states from the characteristic table used as don't cares on the k-map? It's a question some watchers are asking.
Alexandre Soares da Silva Invalid case arises when output can be anything (0 or 1) and is not controlled by inputs. So it is a type of don't care condition only.
The prev video actually explained this thing🙂
it didnt actually
@@dasamlan9874
0:36 the concept of Qn & Qn+1
1:04 will be the remain ?? remain of what ? what is it exactly what you mean ? your explanation about Qn and Qn+1 somehow not all people understand sir, please explain throughly and deeply so we understand 0+0 is 0 or 1+1 is 2 sir. do not explain ?+? = ? we don't understand the '?' thank you sir.
+Neso Academy okay i'm try to get it, one question, what is all purpose to find characteristic table and excitation table ?
mas bro not remain, the word was 'determined' bro
Thank you, sir.
Thank you so much first time i understood flip flop properly. I had hard time understanding flip flop throughout my engineering but finally i got everything. Just wanted to know why we made this different tables. What are there uses i have completed all the videos till now may be i will understand this in later videos and if not please answer.
Thanks a lot
Hello Alka, I hope you understood the concept clearly.....
Super very useful sir
What will be the value of S and R value with the help of K-map and also why the result of the K-map of Qn and SR is Qn +1?
we can use the minterm formula to acquire a boolean expression for S and R. S=sum of minterm(1)+ Minterm 3 is a dontcare or we can construct a K map with Qn and Qn+1 , fill in the values for S and where we have dont care put a 1.S=Qn+1. Similarly for R=~Qn+1. If i am wrong someone please correct me!