im slightly confused when you said the right logical shift is MOD division. isn't is DIV division as its returning the whole number and not the remainder e.g 15 DIV 2 would return 7
I'm a bit confused, is the steps really important for the binary shift at the end or do you get marks for writing the steps for example in this case writing the steps for three? (this question is for the question at the end of the video)
They can be used to round I believe, but I've only ever used a right shift in programming for division, just because often algorithms work by dividing things (arrays, memory, GPU threads etc) by 2, and this is a super efficient way to do it - they are so trivial for a computer to do
A ''binary shift of 2" means you are either dividing by 4 or multiplying by 4 depending on the direction of the shift. It's 2 to the power x (2^x) where x is how many shifts you are doing
Thank you so much! I have an exam tomorrow and i was afraid i might never understand that.
same bro :)
yeah i also had a big test thanks a lot!
There is a question which says
State one effect this logical shift has on the binary value.
Please answer this as I don’t get it
We might lose our data if we depend on logical shifter
im slightly confused when you said the right logical shift is MOD division. isn't is DIV division as its returning the whole number and not the remainder e.g 15 DIV 2 would return 7
Yeah, if I said that mistakenly I apologise
@@MrBrownCS would the last one not produce an overflow error?
the tutor was nise but I'm not clear because of your speed
because ur African black man you dumb
I'm a bit confused, is the steps really important for the binary shift at the end or do you get marks for writing the steps for example in this case writing the steps for three? (this question is for the question at the end of the video)
Best to do each step, especially if there are working marks (i.e. it's not a 1 marker)
you are very good sir thank you
Isn't right shift multiply, and left shift divide, so I don't get what u said
right shift divide and left shift multiply. Although don't think it will be useful after ~ 730 days 😁
@@arnoahmed9269 too late lol
Hello sir,
Can you do a proper playlist for Computer Science P3 summarised theory videos ?
oh look its fellow royality
lmao 😭😭
Does the overflow error also occur in right logical shift? or is it just for the left one?
Only for increase (left) I think. In a right logical shift it just wouldn't make any sense
What would be the reason for doing this? Just as a way of multiplying and dividing or does it go further than that?
They can be used to round I believe, but I've only ever used a right shift in programming for division, just because often algorithms work by dividing things (arrays, memory, GPU threads etc) by 2, and this is a super efficient way to do it - they are so trivial for a computer to do
Computer Science Tutor ah okay, thank youu
@@MrBrownCS For rounding I would just use a bitwise AND, with zeroes up to the LSB for rounding, then ones the rest of the way.
So if you do a binary shift by 2 you are doing it by 8?
A ''binary shift of 2" means you are either dividing by 4 or multiplying by 4 depending on the direction of the shift. It's 2 to the power x (2^x) where x is how many shifts you are doing
Computer Science Tutor ah thank you ❤️
Is logical shift and binary shift the same thing?
I think so lol
Thanks brother!
Hi There: Could you explain why 1101 is 13 in base 10 ? Thanks for this amazing video!
Search bar's right up there mate.
8 + 4 + 1 = 13
tysm
how much marks would this be worth in the exam?exam tomorrow YIKES!
Probably only a couple. Good luck!
lmao bestie i thought he was speaking french in the beggening
Shifting bits appears here to assume a big-endian system. But the thing is, computer registers, memory addresses, and processors are LITTLE-endian!
who is 13 years old and is trying to do their homework due in 10 minutes
not me)))