Bitwise Operations & Bit Masking 

I've spent so long trying to understand this on my own, with my prof, and with other videos but none made it click as easily as this one. Thank you so much

the cleanest and best explanation ever on bit masking. great job!! thank you appreciate your hard work.

This video has saved my life. Have spent a few hours trying to decipher what my lecturer explained and this has cracked it. Thanks!

This is by far the clearest explanation on bit masking I have watched. Thank you so much. Subed.

thank you for your explanation XD I have been searching for Bitwise explanation and this is the best video I ever seen.

Fantastic! I loved your tutorial. God bless you! Best content explaining bitwise that I found on the Internet. 🥰

The clearest explanation!!! Appreciate it so much!

THIS IS FANTASTIC! Oh my god, you explained it so elegantly - I understood everything immediately!!! do note that on the last example (Clearing digit 5 to 0), the table showes a XOR gate table, instead of the OR gate table (:

So clearly summarized! Amazing! Thank you so much!

Best tutorial on bitwise operators.

Great Explanation. I recently wrote a .js file that carries out a Bitwise NOT on a negated string and outputs it as Base64.

Thankyou so much! Your video saved my broken brain 👍🫶🏻

Thank u soo much bro!! understood everything on the first go

Thanks, It's simple to understand

you are a livesaver man

i am surprised you got very few likes over the 2 years this video has been on. Thumbs-up of course. Just three tips: 1. Don't point with your mouse - draw a rectangle or a circle around what you are trying to highlight. Your mouse pointer is small and learners have trouble tracking it (I asked several and we all agree :) ). 2. Please, put the word description of the bitwise operation next to its symbol, e.g., NOT !, AND &, etc. 3. For the last, more involved example, I would follow your explanation with a simplification: First, flip all original bits, then flip only the target bit (with an OR | mask), and finally flip everything in the masked result back (with a NOT !). Only the targeted bit ends up different from all the original bit we started with. This explanation just helps learners shift their attention from the very visible 0s and 1s to the way less visible Data, flipped, Mask, OR result, and Flipped back labels on the very right, which is probably what you want them to focus on. I would also draw two red rectangles around original target bit in the starting binary value and that bit in the final result. Best of luck. I know you will do great :).

Finally, i learned masking thank you

thank you!really clear explanation

worth more than 400 views amazing vid

The first 4 minutes of this video did a better job explaining than a 45 minute lecture (and the convoluted ass explanations in the textbook).

Wonderful ❤

For clearing bits, wouldn't you be able to use an AND instruction and use a mask that has all 1's but the ones you want to clear? 1111 0101 AND 1110 1111 would result in the same thing but in less operations since the other bits would remain the same?

Regarding clearing a bit So given the definition of bitmask as "A value where only the bit you want to act on is set to 1 and all other bits are 0" If we want to clear a bit we need to get the NOT of the above bit mask and then the result can do an AND with original number to clear that particular bit of interest. For me the order in which he explained was confusing. Hope this help people like me

clearing a digit to 0 could be done with &= ~FLAG operation.

Outstanding, thank you

First of all, The subject is well explained and the use of examples was great. But, my question is, in the last part of the video, why do we need to flip twice instead of doing 1111 0101 DATA & 1110 1111 MASK ---------------- 1110 0101 RESULT

Thank you :)

THANKS A LOTTT

could you also use a bitwise AND with a flipped mask to clear a digit to 0?

Don't know for sure but can you check indexing of bits .

thank you very much sir

Excelent explained ! Why? because you used examples !

Nice

why can't you just do a AND mask to clear a bit to 0? input _ _ _ _ _ B _ _ _ _ AND mask 1 1 1 1 0 1 1 1 1 ---------------------------------------------- result _ _ _ _ 0 _ _ _ _ right? (bit B is cleared to 0 and all other bits are preserved?)

Here is a Rust example of 3:17 or 5:05 :D fn main() { let x = 0b1011; // Byte let y = 0b1000; // What bit? println!("{:b}", x & y >> y -1) }