2.1.4 Binary Shifts

What is the result of a left shift operation on the binary number 1010 by 2 positions?

• 101000

• 1001

• 10100

• 100000

Which of the following best describes a right logical shift operation?

• Moves all bits to the left and fills with zeros

• Moves all bits to the right and fills with zeros

• Moves all bits to the left and fills with ones

• Moves all bits to the right and fills with ones

What is the main difference between arithmetic and logical shifts?

• Arithmetic shifts fill with zeros, logical shifts fill with ones

• Arithmetic shifts preserve the sign bit, logical shifts do not

• Arithmetic shifts are faster than logical shifts

• There is no difference

If you perform a left shift operation on the binary number 1101 by 1 position, what is the result?

• 11010

• 1011

• 1110

• 1100

Which of the following is an application of binary shifts?

• Multiplying by powers of two

• Dividing by odd numbers

• Calculating square roots

• Generating random numbers

What happens to the least significant bit (LSB) during a right shift operation?

• It becomes the most significant bit (MSB)

• It is discarded

• It remains unchanged

• It is set to zero

In a logical right shift, what is the value filled in the most significant bit (MSB)?

• 0

• 1

• The original MSB value

• It alternates between 0 and 1

How does an arithmetic right shift differ from a logical right shift?

• Arithmetic right shift fills with zeros, logical right shift fills with ones

• Arithmetic right shift fills with the sign bit, logical right shift fills with zeros

• Arithmetic right shift is slower than logical right shift

• There is no difference

What is the result of a left shift operation on the binary number 0000 0110 by 3 positions?

• 1011 0000

• 0000 1100

• 0001 1000

• 0011 0000

Using an arithmetic shift right by 1 on this signed binary number will produce...

1011

• 0101

• 1101

• 1110