LMU ☀️ CMSI 2210
COMPUTER SYSTEMS ORGANIZATION
Exam 1

The test is open-everything with the sole limitation that you neither solicit nor give help while the exam is in progress.

Submit all answers on these exam sheets. No extra sheets are allowed. If you are nervous about this, work out the problem on a separate sheet and copy your answers here. Work quickly but carefully. The exam is not designed for everyone to finish; the intent is to make sure the people most familiar with the material get the best grades.

ProblemYou gotOut of
112
216
39
48
515
68
712
820
90
TOTAL100
  1. (12 pts) Assuming a 16-bit storage word complete the following table:
    Unsigned Decimal Signed Decimal Hexadecimal
     -9999 
      C330
    8003  
  2. (16 pts) Do the following 16-bit sums, assuming SIGNED arithmetic, for both saturated and modular addition. Indicate for each whether the modular arithmetic produced a carry and/or an overflow.
      Sum — Modular Carry
    (Y/N)
    Overflow
    (Y/N)
    Sum — Saturated
    7000 + 8000    
    F221 + DFFF    
    7FFF + 0001    
    8CCC + 8011    
  3. (9 pts) Express each of the following in gibibytes, using a decimal value for the number of gibibytes. For example, for 235 bytes, you should answer "32 GiB".
      16384 MiB = _______________
    
      16 PiB = _______________
    
      231 + 225 bytes = _______________
    
  4. (8 pts) Give the decimal values of each of the following 32-bit words (shown in hex), assuming the words are IEEE-754 single-precision floating point encodings. Make sure all your answers are exact: you may need to write them in the form mantissa × 2exponent — but you must write the mantissa and exponent are in base-10.
      C5C00000 = _______________
    
      800000E0 = _______________
    
      40E00000 = _______________
    
      7FFFFFFF = _______________
    
  5. (15 pts) Give the IEEE-754 single precision representation (in hex, of course) for the following decimal values.
      -1026.375 = _______________
    
      1.25 × 2–133 = _______________
    
      85 × 2–105 = _______________
    
  6. (8 pts) What is the smallest positive value (in decimal, written exactly, as a power of two) that has an NORMAL IEEE-754 single precision encoding?
      _______________________
    
    What is the largest positive value (in decimal, written exactly, as a power of two) that has an DENORMAL IEEE-754 single precision encoding?
      _______________________
    
  7. (12 pts) Complete the table:
    UTF-32 BE UTF-16 LE UTF-8
    0010A787  
    00000092  
      EF BF BF
  8. (20 pts) Decode the following byte streams (writing characters in U+xxxxxx form). Not every stream can be fully decoded. Decode as much as you can. If and when you get to a point in the stream where decoding is impossible, write <<ISB>> for “illegal start byte,” <<ICB>> for “illegal continuation byte,” or <<NMB>> for “no more bytes,” as appropriate.
    20 00 E3 90 90 C8 88
    
    _________________________________________________________________________
    
    F4 80 80 BB A5 C2
    
    _________________________________________________________________________
    
    C2 AA E0
    
    _________________________________________________________________________
    
    0A 10 F2 A3 10 10
    
    _________________________________________________________________________
    
  9. (EXTRA CREDIT, might be hard) Explain why the grapheme for a woman mechanic contains the character U+1f469 but the grapheme for a woman surfer contains the character U+2640.