i dont usually do youtube comments but I missed class for a week and this is one of the subjects we went through. I scoured the internet to find all this confusing, mumbo jumbo, nothing that quite broke it down to an understandable level. Your video did just that. THANK YOU!!
I sincerely appreciate that you stated at the beginning that these topics are very difficult. I found this easier than I had anticipated, no doubt owing to your skills at explaining things, but if I had struggled with it I would have felt "allowed" to struggle. Other TH-cam educators try to reassure their viewers at the beginning by insisting how "simple" the complicated topics really are, even if they seem intimidating. I understand the good intention behind that approach, but when I watch such videos and then find myself struggling, which is discouraging by itself, I am also doubly discouraged by being unable to quickly grasp what I've just been told should be a very "simple" concept or idea. So, being told up-front that something is difficult but we'll all do our best genuinely helps me persist if I end up getting stuck. Thank you!
I am a diploma in civil engineering student, who got slided into cse. I just wanted to learn C language and searched for many playlists in TH-cam and at last found NESO ACADEMY.. You guys are the best.. I've also installed the app and using it... Thankyou so much 🙏🏻
Result of ~7 is -8. Remember we're dealing with signed numbers here, and where computers represent negative numbers in 2's complement, that means that the sign bit is also flipped. (So if you do a = 7 and b = ~a +1, then b is -7. Cool thing about 2's complement is that you can do it again: a = ~b + 1 and the value of a will still be 7.)
great explanation, I was confused that how does bitwise and work, I'm a 1st yr btech student of cse and my teacher explains nothing so ppl like u are lifesavers, thank u so much
This is my 1st comment for a youtube channel.. The way of explanation and presentation etc etc everything was very excellent. Great job...thank u soooo much for your videos.. This is very much helpful especially in this pandemic situation. Kindly upload videos for DESIGN AND ANALYSIS OF ALGORITHM subject also.
I think it's useful to think of the & (AND) and | (OR) linguistically. If I'm understanding how this works correctly, it goes something like: "If one bit AND the other are true (1), then the result is true (1). Otherwise, the result is false (0)." And likewise: "If either one bit OR the other is true (1), then the result is true (1). Otherwise, the result is false (0)."
Comments for myself: Bitwise operators compares each bit of a value at a time and returns a final value from the formed bits sequence from the operations. e.g. if sequence is 0000 0000 (for char), then it returns 0.
People have asked what the practical use of bt manipulation is. It is used in low-level applications like Hardware Registers, and in compression algos as well as optimization. You can also use bit manipulation to perform common tasks like finding if a number is even or odd. Finding an odd occurance of a number in an array using using Hash Tables takes O(n) time. Bit manipulation on this same task takes O(1). So often times the fastest approach is Bit Manipulation.
i dont usually do youtube comments but I missed class for a week and this is one of the subjects we went through. I scoured the internet to find all this confusing, mumbo jumbo, nothing that quite broke it down to an understandable level. Your video did just that. THANK YOU!!
Bro what did mumbo jumbo do 😭
I sincerely appreciate that you stated at the beginning that these topics are very difficult. I found this easier than I had anticipated, no doubt owing to your skills at explaining things, but if I had struggled with it I would have felt "allowed" to struggle. Other TH-cam educators try to reassure their viewers at the beginning by insisting how "simple" the complicated topics really are, even if they seem intimidating. I understand the good intention behind that approach, but when I watch such videos and then find myself struggling, which is discouraging by itself, I am also doubly discouraged by being unable to quickly grasp what I've just been told should be a very "simple" concept or idea. So, being told up-front that something is difficult but we'll all do our best genuinely helps me persist if I end up getting stuck. Thank you!
I am a diploma in civil engineering student, who got slided into cse. I just wanted to learn C language and searched for many playlists in TH-cam and at last found NESO ACADEMY.. You guys are the best.. I've also installed the app and using it... Thankyou so much 🙏🏻
Glad to know this :)
Same here I also did diploma in ce and enrolled in cse BTech
Result of ~7 is -8. Remember we're dealing with signed numbers here, and where computers represent negative numbers in 2's complement, that means that the sign bit is also flipped. (So if you do a = 7 and b = ~a +1, then b is -7. Cool thing about 2's complement is that you can do it again: a = ~b + 1 and the value of a will still be 7.)
Absolutely that is why I prefer standard text such as KnR C which cover these small details briefly but elegantly
U r right .he explained nice but in wrong way
bro can u please elaborate the explanation please
Man, my first intro to Bitwise Operators and I feel like I'm learning ABC. Thank you! thank you for explaining things so well!
You, sir, are a life savior.
great explanation, I was confused that how does bitwise and work, I'm a 1st yr btech student of cse and my teacher explains nothing so ppl like u are lifesavers, thank u so much
Much better introduction to bitwise than my college instructor. Thanks!
Right😂
Same here
This is the best explainer ive ever watched.. ever. Great quality!
Want to see the man behind this great work
You can see his Instagram id. It's mentioned in description box.
You are teaching better than my professor Who has Ph.D from IIT . Love you sir really helpful. I want to know who is the CEO of NESO?
Finally cleared the difference between logical and bitwise operators in 7 minutes!
Sir u r God.... Sir...... Explaination goes peaks... In c language........ Tq soo much sir..... Love ❤ neso academy.....
One of my friends scored top marks in exam. Today I realised he is the student of NESO Academy.
explainig the whole concept in just a little bit of time is amazing
This is my 1st comment for a youtube channel..
The way of explanation and presentation etc etc everything was very excellent. Great job...thank u soooo much for your videos..
This is very much helpful especially in this pandemic situation.
Kindly upload videos for DESIGN AND ANALYSIS OF ALGORITHM subject also.
This was giving me so much trouble to wrap my head around!!! Thank you for this!!!
Thanks sir its clean and clear
The indian youtuber coming in clutch
An excellent and simple video of bitwise operations in C. Keep up the good work!
That example made it crystal clear.🙏
The way you explained each concept is awesome 👌🏾👌🏾
Thanku for this amazing videos
The whole series is very well explained
Great explanation! This topic has always been quite confusing to me but you've cleared it up.
Very clear and concise explanation, thanks.
a clear level of explanation....
thank u..
Really easy to understand with clear examples ❤️
This was easily understood, thanks for the detailed explanation.
I think it's useful to think of the & (AND) and | (OR) linguistically. If I'm understanding how this works correctly, it goes something like: "If one bit AND the other are true (1), then the result is true (1). Otherwise, the result is false (0)." And likewise: "If either one bit OR the other is true (1), then the result is true (1). Otherwise, the result is false (0)."
Very well explained! Keep it up...!
this method you are using to explain make eveything so easy to be undrestood
Very well explained. Thank you.
this is the best explanation of bitwise function
Thank you indian youtube man. I don't know who you are or why you know literally everything there is to know, but thanks yet again for saving me.
Nice video buddy,
Loved it
Thank you sir very nice gide & very nice best information bitwise operator teaching video.👍
It would be nice to see examples of how these are useful rather than explain them in the abstract. Thank you for making the video.
it was easy to understand, an awesome video.
thank a lot you help me finish my home work!
sir i think ~7 must be -8 not 8 bcs you used %d in printf i.e integer data type which uses 2's complement representation
Ах вот почему ракеты падают!
@@lemmenmin7676😂😂😂
Then how to represent 8 in binary form?
You are correct 💯
best tutorial ever about this topic!
Thanks alot..❤😊💕👨🎓
Wow this is SO clear.
Excellent video, one of the best C tutorials I’ve seen so far
Thank you, your way of delivering the information is simple and easy to be understood.
AND(&) 1:16
OR(|) 2:55
NOT(~) 3:43
Your explaination is spot on, me having trouble understading yet took me 5 mins to understand from u
Thank you very much Neso Academy!
Thank you so much for this tutorial. I've been looking for an detailed and understandable explanation on this for hours.
Comments for myself: Bitwise operators compares each bit of a value at a time and returns a final value from the formed bits sequence from the operations. e.g. if sequence is 0000 0000 (for char), then it returns 0.
Thank you for this great video!
Thank you sir it was a nice explanation
Thanks again, you seem to have my entire college course made in youtube lol.
I Liked that NESO TV has an integrated cam as well.......
Thnku so much dude 😇
You are really Amazing..... Such a detailed explanation I found no where
I love you NESCO ACADEMY
Thank you so much. This lecture was very helpful.
man, perfect explanation.
you are my master, master.
today's best video for me.
🙏Thank you sir for giving this knowledge. 🙏
Awesome Explanation Sir
People have asked what the practical use of bt manipulation is. It is used in low-level applications like Hardware Registers, and in compression algos as well as optimization.
You can also use bit manipulation to perform common tasks like finding if a number is even or odd.
Finding an odd occurance of a number in an array using using Hash Tables takes O(n) time. Bit manipulation on this same task takes O(1). So often times the fastest approach is Bit Manipulation.
Very well done Sir.
Very clear. Thank you so much!
Great explanation. Thank you!
Thanks a lot for such high quality educational content!
Simply amazing !
Excellent work sir I have my exam day after tomorrow and this video helped me a lot sir...tqsm
Thank you so much. I want to download this
I can bet you won't miss a single thing if you are following neso from the very beginning.
this was extremely clear thank you!
Keep it up . Nice explanation
Thkz
Detailed explaination.....
Simply super sir
great video! Very helpful!
Amazing!
Wow sir brilliant
Very good explanation sir.
Works for Java as well thanks !!!!
Great explanation
Nice class sir
POG 💪🏻
Thank you
Thanks for help.
Thank you!!!
Thnaks bro
Well explained!
great lecture
Great explained very good
One issue is there in ~7= -8
Can you explain it🤔
bro neso tv availabe on amazon or platform? byw nice teaching skill u have.
Thank you so much sir
the voice is soo sweeet :-)
"Result of x&y is 1" ??
shouldn't that be "Result of x&y is 0" ?
great series of videos by the way
many thanks for sharing your knowledge
Please explain with 8 bit machine, thanks
Super sir
Nice❤️