CS220 Practice Quiz 2



  Choose the best alternative:
  1. How many different values can be represented with 3 bits?
  2. How many different values can be represented with 5 bits?
  3. What is the largest unsigned integer that can be represented with 3 bits? Please convert to decimal.
  4. What is the largest unsigned integer that can be represented with 5 bits? Please convert to decimal.
  5. A byte consists of_____ bits.
  6. For INTEL-BASED computers , 1 WORD consists of___ bits.
  7. For INTEL-BASED computers , 1 WORD consists of ___ bytes.
  8. For INTEL-BASED computers , a DOUBLEWORD consists of ___ bits.
  9. For INTEL-BASED computers , a DOUBLEWORD consists of ___ bytes.
  10. What is the byte complement of 11001011?
  11. What is the word complement of 0000000000001011?
  12. The complement of a negative number is...
  13. In 2's complement, the 8-bit binary number 01010101 is .....
  14. In 2's complement, the 8-bit binary number 10101010 is .....
  15. In 2-s complement, the 4-digit hexadecimal number 7EEF is ....
  16. In 2-s complement, the 4-digit hexadecimal number 8010 is ....
  17. What is the largest 5-bit negative integer (in decimal) that can be represented using complement notation?
  18. Convert 11111111 (a signed byte) to its decimal equivalent.
  19. Using 1 byte (8-bits), convert the decimal number 14 to binary (base 2).
  20. Using 1 byte (8-bits), convert the decimal number -25 to binary (base 2).
  21. Using 1 byte (8-bits), convert the decimal number -2 to binary (base 2).
  22. In the hexadecimal number A32C the MSD (most significant digit) is .....
  23. In the hexadecimal number A32C the MSB (most significant byte) is .....
  24. In the hexadecimal number A32C the LSD (least significant digit) is .....
  25. In the hexadecimal number A32C the LSB (least significant byte) is .....




  Answers:
  1. 8 The number of different values you can represent with n bits is 2^n. Therefore 2^3 = 8.
  2. 32 The number of different values you can represent with n bits is 2^n. 2^5 is 32.
  3. 7 The largest value occurs when all 3 bits are 1's (111 = 7). TIP: 2^n - 1 is the largest value.
  4. 31. 2^n - 1 represents the largest unsigned value. 2^5 - 1 = 31. Remember, the largest unsigned value occurs when all 5 bits are 1's (11111 = 31)
  5. 8. On most computer systems, 8 bits contitutes 1 byte.
  6. 16. 16 bits constitutes 1 word in the M68000 system.
  7. 2. Remember, 1 word = 16 bits and 1 byte = 8 bits.
  8. 32 bits (4 bytes) constitues a long word.
  9. 4 bytes = 32 bits
  10. 00110101. The complement is achieved by reversing each bit and adding 1. Remember, 1 byte = 8 bits.
  11. 1111111111110101. The complement is achieved by reversing each bit and adding 1. Remember, 1 word = 16 bits.
  12. POSITIVE. The complement of a number is its negation.
  13. POSITIVE. . A binary number is positive if its MSD (most significant digit) is 0.
  14. NEGATIVE. The MSD (most significant digit) is 1, therefore it is a negative binary number.
  15. POSITIVE. A hexadecimal number is positive if its MSD (most significant digit) is one of 0 through 7.
  16. NEGATIVE. The MSD (most significant digit) is 8, therefore it is a negative number.
  17. -16. Integers from - 2(n-1) through 2(n-1) -1 can be represented. - 24 = -16.
  18. -1. 11111111 is negative. Find its complement: 00000001 (1), then add a negative sign, -1.
  19. 1110. 14 is a positive value, so we can simply convert it into its binary equivalent using 8-bits.
  20. 11100111. First, convert 25 to binary : 00011001. Then, find its complement : -25 = 11100111.
  21. 11111110. First, convert 2 to binary : 00000010. Then, find its complement : -2 = 11111110.
  22. A
  23. A3. One byte is two hexadecimal digits.
  24. C
  25. 2C. One byte consists of two hexadecimal digits.