Quiz 6.3

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.3

  1. Which method of encoding negative integers in binary simply slaps a 0 in front of an unsigned binary number for positive, and a 1 for negative?
sign-magnitude
1's complement
2's complement

  1. What do we call the process of adding extra 0s at the left end to ensure that there are always the same number of bits in a number?
2's complement
big endian
padding out

  1. 6 is 1102. What would -6 be in sign-magnitude notation, assuming there are 10 bits?
0000000110
1000000110
0000001110
1111111001

  1. Which of the following numbers can't be represented in 4 bits sign-magnitude form?
-4
-7
+67
0

  1. How many 0s are there in sign-magnitude notation?
only one, silly!
two
three
four

  1. How do we transform a negative binary number to 1's complement?
flip all the bits
flip all the bits and add 1
simply append a 1 to the left end of the unsigned form

  1. What is -1 in 10 bits 1's complement?
0000000000
1111111111
1000000001
1111111110

  1. Which method of encoding negative integers in binary is used in most computers today?
sign-magnitude
1's complement
2's complement

  1. What is -7 in 1's complement assuming there are always 5 bits?
11000
00111
10111
10001

  1. Why is 2's complement used instead of sign-magnitude?
Konrad Zuse thought it was a good idea so it is an historical accident
binary numbers are shorter
it is faster to add two numbers
you don't need a special subtraction circuit