Quiz 6.7

DIRECTIONS: Read each question carefully. Then click on the dot next to the answer that most closely fits the question. Try to answer all questions on this quiz and when you are done, click on the grade me button at the bottom.

Coverage: Section 6.7

  1. Which kind of shift is also called a rotate?
arithmetic
logical
diagonal
circular
numeric

  1. If you did a 1-bit right logical shift on 1111, what would you get?
0111
1111
1110
1101

  1. If you did a 1-bit right arithmetic shift on 1001, what would you get?
0100
0010
1000
1111

  1. Which kind of shift does not lose information?
arithmetic
logical
circular

  1. If we think of the bit strings as unsigned binary numbers, which shift would be "divide by 2"?
1-bit left logical
1-bit right logical
1-bit right circular
2-bit right logical

  1. Which bit is sticky in arithmetic shifts?
the most significant bit
the least significant bit
all of them
none of them

  1. What would be the arithmetic operation corresponding to 3 bits left logical shift?
multiplication by 2
multiplication by 4
multiplication by 8
division by 8

  1. What would an 8-bit right logical shift do to 10110111?
zero it out
leave it unchanged
fill it with 1s
scramble it randomly

  1. What would an 8-bit right circular shift do to 10110111?
zero it out
leave it unchanged
fill it with 1s
scramble it randomly

  1. What would we get after a 2-bit left arithmetic shift to 11111010?
10101111
10100000
11101000
11110100