Can you please help me, I started watching lectures from the start , I didn't get Boolean algebra, it has some different concepts which haven't been taught before in this playlist , so I jumped ahead to the number system, can anyone or you please guide me.
@@gamingchannel1456 try reading Digital Design by Morris Mano, or there are loads of videos available on youtube that explain concepts of Boolean Algebra
Sir your lectures are awesome best lecture I have ever seen in digital electronics.Covered all topics . Anyone preparing for competitive exam (gate/ies/drdo or any other PSU) these lectures are more than sufficient to cover each and every topic. Conventional topic also covered in lectures . Thanks a lot .
It seems as gray to binary and binary to gray conversion are same but in fact they are totally different. You must see previous video again to understand this if you didn't. Sir hasn't completely stated the difference in his rules.
I think it is hard to notice every little difference in all of 200 videos. However, I think it's logical you would want to watch both videos if you study :)
Yea true. Initially after seeing the rules, I literally started solving it with the previous method but then gradually I realised this method is different from the previous one In previous method, we keep performing X-OR with every binary bit consequently. In this method, we perform X-OR with the resultant binary bit and the next gray code bit.
Hey Anmol😁 Even though they are very simillar, they aren't written the same way, can you spot the difference?🧐 Hint * : 2 words Hint ** : whats written after "next bit" ? Hope that clears it up :)
This is the only channel where I get angry at the autoplay option because I have to come back to like the video, I can't skip this channel's videos without liking man!!
May GOD Bless you sir thank you so much for your slides i feel like getting 99% on the exam your lectures are awesome best lecture I have ever seen in digital electronics
The sequence you are taking for p1 p2 d3 p4 d5 d6 d7 form left to right should be taken from right to left because in every question that we solved the from books the sequence is taken from right to left to get the correct code, so please look into this and explain.
Incase you wanna do it program. A gray code is bascially just the sum of Xor of bits starting from that position of bit. For examples the Nth bit from gray to binary gonna be Nth^N-1^N-2^N-3^...to the last set bit. In program you can achieve this by just creating variable like b that starts from 0 and Xoring it with the gray code and then storing the value of it in b (b=b^gc). while the n is right shifting by 1 in each iteration(n=n>>1) until it reaches 0
To generalize the xor equation, one can assume infinite leading 0s which would lead to infinite leading 0s in the binary (0 xor 0 is 0) and then in the first bit we have 0 XOR 1 which is 1. In this way we don't need special cases.
Tq tq so much sir because your teaching way is so simple and easy........And the concept of your explanation is too good❤❤❤❤such a you are life saviour for me sirrrr......🙏🙏🙏
instead of saying thanks I think u all should donate some money to him for the sake of the channel for the sake of the knowledge like Rs 200 or 100 or per month
You wrote the step 2 the same sentence..for both videos...that is binary to gray and gray to binary...but you did the process differently...i m soo confused ...please help
There means in the first video you have to perform XOR operations between the bits but here you have to perform XOR operations to the resulatant and next bits.
Hey😁 Even though they are very simillar, they aren't written the same way, can you spot the difference?🧐 Hint * : 2 words Hint ** : whats written after "next bit" ? Hope that clears it up :)
Hi, If i convert 1001 (bin) to Gray code i get: 1110 If i convert 1110 (Gray) to Binary, i get: 1011 Is this normal? shouldnt my conversion from gray to binary be the orginal 1001?
Converting 1001 ( binary ) to gray should give you 1101 instead of 1110. There is, I believe, a slight mistake in the steps he's written. To put it straight, while converting from binary to gray, you have to XOR the bits of the original number. That is, to convert 1001 to gray, I'll put '1' as it is, then XOR 1 with 0 giving me '1', then XOR 0 with 0, giving me '0' ( and not 1 ) and then finally, I'll XOR 0 and 1, giving me '1'. Hence 1001 to gray is 1101. To convert from gray to binary, I'll have to XOR what's recorded with the next digit. Hence, converting 1101 to binary, I'll put '1' as it is, then XOR 1 ( that's recorded ) with 1, giving me '0', then XOR 0 with 0, giving me '0', and finally, XOR 0 and 1, giving me '1'; thus my number will be 1001, again. Hope that helps
It has not been easy for me since I started investing in forex trading,, I have work with many traders due some are good but the lose is greater than the gains but since my friend introduced me to Mr Charles forex trading i have never loss any trade now I really know that forex trading is really profitable and reliable... With the help of Mr Charles I no more bother about financial issues you can reach him on this mail..
Even after 4 years neso academy is famous for its lectures. You are a life saver before exams
True
Can you please help me, I started watching lectures from the start , I didn't get Boolean algebra, it has some different concepts which haven't been taught before in this playlist , so I jumped ahead to the number system, can anyone or you please guide me.
@@gamingchannel1456 try reading Digital Design by Morris Mano, or there are loads of videos available on youtube that explain concepts of Boolean Algebra
Why the two are same 1000-1111 & 1100-1000??
6 years*
Gray to binary
1: 1100-->1000
2: 1011-->1101
3: 1000-->1111
true
Everything is correct..
My ans is also same
❤
I got it like this
it's been 7 years video uploaded
and here iam studying day before exam
You are a great help to students
tomorrow is my exam and im still able to cover the entire syllabus with neso academy's 8 years old videos. hats off
Sir your lectures are awesome best lecture I have ever seen in digital electronics.Covered all topics . Anyone preparing for competitive exam (gate/ies/drdo or any other PSU) these lectures are more than sufficient to cover each and every topic. Conventional topic also covered in lectures . Thanks a lot .
i am cse student these are enough for digital course if they have
This lecture is too easy to understand. Respect from Bangladesh.
I want to ask why u guys have killed Hindus there. Plg respond.
@@saurabhsaxena1992 , damn this is an educational channel , dont spread your propaganda here.
@@saurabhsaxena1992mf you mean what happened in Gujarat and kashmir under your dad's modi's rule?
It seems as gray to binary and binary to gray conversion are same but in fact they are totally different.
You must see previous video again to understand this if you didn't.
Sir hasn't completely stated the difference in his rules.
I think it is hard to notice every little difference in all of 200 videos. However, I think it's logical you would want to watch both videos if you study :)
Yea true. Initially after seeing the rules, I literally started solving it with the previous method but then gradually I realised this method is different from the previous one
In previous method, we keep performing X-OR with every binary bit consequently.
In this method, we perform X-OR with the resultant binary bit and the next gray code bit.
Hey Anmol😁
Even though they are very simillar, they aren't written the same way, can you spot the difference?🧐
Hint * : 2 words
Hint ** : whats written after "next bit" ?
Hope that clears it up :)
@@goshikasaravana
Yup! That's basically the intuition :)
Yaaa true!!
This is the only channel where I get angry at the autoplay option because I have to come back to like the video, I can't skip this channel's videos without liking man!!
Wow...I'm loving the experience as well👍🏾👍🏾
Amazing i just love to watch your lectures , totally satisfying ...
May GOD Bless you sir
thank you so much for your slides
i feel like getting 99% on the exam
your lectures are awesome best lecture I have ever seen in digital electronics
i wonder after 5 years of publishing the lecture its damn fresh understanding n quite easy.simply loved ur explaination.
The sequence you are taking for p1 p2 d3 p4 d5 d6 d7 form left to right should be taken from right to left because in every question that we solved the from books the sequence is taken from right to left to get the correct code, so please look into this and explain.
I was struggling to understad this, very nice explanation thanks
Thanks sir I'm in polytechnic the way you teach quite easy to understand... it helps me for the subject digital techniques 🤗🤗
Mee too
Incase you wanna do it program. A gray code is bascially just the sum of Xor of bits starting from that position of bit. For examples the Nth bit from gray to binary gonna be Nth^N-1^N-2^N-3^...to the last set bit. In program you can achieve this by just creating variable like b that starts from 0 and Xoring it with the gray code and then storing the value of it in b (b=b^gc). while the n is right shifting by 1 in each iteration(n=n>>1) until it reaches 0
To generalize the xor equation, one can assume infinite leading 0s which would lead to infinite leading 0s in the binary (0 xor 0 is 0) and then in the first bit we have 0 XOR 1 which is 1. In this way we don't need special cases.
Whats the "special cases" needed in the first place? The expressions aren't really case dependendant... aren't they?
Even after 7 years neso academy is famous for its lectures.
I am very much impressed by your explanation, it's very simple that a 1st std child can also understand it, very nice work done
Converted Gray to Binary
1: 1100 = 1000
2: 1011 = 1101
3: 1000 = 1111
Thanku Sir ❤
You are very correct
your videos are very helpful for engineers
Thanks sir for your explanation 🙏🙏
H. W problems answers
1)(1100)gray = (1000)binary
2)(1011)gray = (1101)binary
3)(1000)gray = (1111)binary
Thanks for showing how to perform the conversion. It would be great if you explained why it works.
Oh man this youtube channel requires hall of fame
We can use one method or not either xor or general
a.)1100
Sol:1000
b.)1011
Sol:1101
c.)1000
Sol:1111
we really appreciate your help in this cray code conversion to binary problems, i really had no idea but now im excelling, ☺
Tq tq so much sir because your teaching way is so simple and easy........And the concept of your explanation is too good❤❤❤❤such a you are life saviour for me sirrrr......🙏🙏🙏
a- 1000
b-1101
c- 1111
1) 1000
2) 1101
3) 1111
tc sala xD
Great way of teaching
Really appreciable
Thanks 🙏🙏 for making this pandemic time to be learning time
fantastic teaching
Ok let me do it !
Even after 8 years of upload it's fking relevant guys
instead of saying thanks I think u all should donate some money to him
for the sake of the channel
for the sake of the knowledge
like Rs 200 or 100 or per month
Good decision bro
Yaa i will do
The intro music is really nice : Music: Finding the Balance
Gray to binary
1: 1100-->1000
2: 1011-->1101
3: 1000-->1111
]
1-> 1000
2-> 1101
3-> 1111
😊
Thank you sir
Thank you so much Sir...😊👍🏻
You wrote the step 2 the same sentence..for both videos...that is binary to gray and gray to binary...but you did the process differently...i m soo confused ...please help
right said
There means in the first video you have to perform XOR operations between the bits but here you have to perform XOR operations to the resulatant and next bits.
yes u are right!!
Hey😁
Even though they are very simillar, they aren't written the same way, can you spot the difference?🧐
Hint * : 2 words
Hint ** : whats written after "next bit" ?
Hope that clears it up :)
Sir your teachings are excellent ❤️❤️. Could you do videos on python 🙏🙏
How easy you made it !!!🤗
Your Method is soo good ...Thanks
Thank you so much Sir
superb sir
Genius bro thanks its is very helpful for me to understand from your channel ❤️❤️
Was unable to understand in class lectures.....now im ready for tomorrow's test😅😅
true life saver before exams
i. 1100 - 1000 binary no.
ii. 1011 - 1101binary no.
iii. 1000 - 1111binary no.
thank you teacher
Excellent teaching!
digital electronics is useful for cse students
i want to prepare for gate are this videos sufficient or more
no
Hey, did you graduate already?😯
All lecture are satisfying
Excusme sir is there a difference between binary to gray code and gray code to binary or they are the same process?
HW ANSWERS :
GC => BINARY
1. 1100 => 1000
2. 1011 => 1101
3. 1000 => 1111
Thank you so much for helping us all
Thnks
Great explanation
thank you sir
hw answers:
1: 1100-->1000
2: 1011-->1101
3: 1000-->1111
Thank you 😢
Thank you so much
SIr you are a life saver
Thanks sir
I have a doubt that there is no difference by doing example s with x-or and starting example right????
nice one
Sir.. U are great.... 👌
Solutions -
1)1000
2)1101
3)1111
Thank you
Sir.please give lecturer on digital logic families
Thanks a lot
thank u brother
Hi,
If i convert 1001 (bin) to Gray code i get: 1110
If i convert 1110 (Gray) to Binary, i get: 1011
Is this normal? shouldnt my conversion from gray to binary be the orginal 1001?
Converting 1001 ( binary ) to gray should give you 1101 instead of 1110. There is, I believe, a slight mistake in the steps he's written. To put it straight, while converting from binary to gray, you have to XOR the bits of the original number. That is, to convert 1001 to gray, I'll put '1' as it is, then XOR 1 with 0 giving me '1', then XOR 0 with 0, giving me '0' ( and not 1 ) and then finally, I'll XOR 0 and 1, giving me '1'. Hence 1001 to gray is 1101. To convert from gray to binary, I'll have to XOR what's recorded with the next digit. Hence, converting 1101 to binary, I'll put '1' as it is, then XOR 1 ( that's recorded ) with 1, giving me '0', then XOR 0 with 0, giving me '0', and finally, XOR 0 and 1, giving me '1'; thus my number will be 1001, again. Hope that helps
@@kushagradhawan6875
Hey :),
You reworded what he literally did, where do you see a mistake?🤔
sir binary to gray code conversion nd gray code to binary conversion me same process follow krni h ya koi difference hai
No bro you're wrong.
Noo it's totally different
thank you
Who is here in 2022? i am on 1-January-2022😍😍🥰🥰😘😘 #HappyNewYear
Gray Code to Binary Conversion
1. 1100 = 1000
2. 1011 = 1101
3. 1000 = 1111
Very helpful
Thankyou
Why do we do xor operation
Thanks bro
very helpfull i make vegova now
1: 1100-->1000
2: 1011-->1101
3: 1000-->1111
clear is the lecture
Awesome videos. A small secret between us my professor follows you.
It has not been easy for me since I started investing in forex trading,, I have work with many traders due some are good but the lose is greater than the gains but since my friend introduced me to Mr Charles forex trading i have never loss any trade now I really know that forex trading is really profitable and reliable...
With the help of Mr Charles I no more bother about financial issues you can reach him on this mail..
(Charlesclinton877@gmail .com)
1) 1100=1000, 2) 1011=1101, 3)1000=1111
Thanks Sir😃😃
is this possible to get through k map ? for the boolean expression
For 1. 1000
For 2. 1101
For 3. 1111
1. 1000
2. 1101
3. 1111
And 2-1101
And 3-1111
Hw problems:-
1.)1100=1000
2.)1011=1101
3.)1000=1111
1. 1101
2. 1111
3. 1000
Pls try gray to excess3 conversion
I've xam tmrw
please volume up your videos
home work gray to binary answers 1)1000 2)1101 3)1111
answers:-i)1000
ii)1101
iii)1111
i) 1000
ii) 1101
iii) 1111
1. 1100 = 1000
2. 1011 = 1101
3. 1000 = 1111
1-1000
2-1101
3-1111