previous
 next 
CS 3843 Computer Organization
Spring 2014 Midterm Exam 1


This will be a closed book exam.
You may use a calculator, but you need to show the steps in solving the problems, not just write down the answer.
The calculator can be used only for add, subtract, multiply, and divide, plus to check your answers.
Any other operations must be shown.
If your calculator is programmable, it may not be programmed to solve any of the problems for this course.

You are responsible for understanding all of assignments and material from the textbook.
The exam will cover Chapter 2.

Many of the problems on the exam will be similar to recitation problems and the daily questions.

The exam will probably have about 20 short answer questions worth 3 points each and some longer questions for a total of 100 points.
For the short answer questions there will not be any partial credit and only the answer will be graded.
For the other questions you must show your work and partial credit may be given.
The answer sheet for the short answer questions will look something like this.
The exam will have several pages with all of the short answer questions on one page and the longer questions on the next few pages.
There will be space on the exam for your answers to these questions.
The exam will look something like this.

You will have 50 minutes for the exam.
That averages 2 points per minute.
Some students will have trouble completing the test in the time allotted.
The 3-point problems should be able to be done in under 90 seconds.
If you read such a problem, and don't think you can complete it in about 90 seconds, skip it and go on to the next one.
Do not waste a lot of time on problems that will not give you many points.


Below are a list topics and things you should be able to do.
For some of them, a time is given, indicating how fast you should be able to solve this type of problem.

  1. Know your powers of 2 (instantaneous for small powers)
  2. Base conversions (2 minutes for 5 digits between base 10 and base 16, 30 seconds for 5 hex digits between base 2 and base 16)
  3. Little endian and big endian
  4. Bitwise boolean operators (almost as fast as you can write once in binary)
  5. Logical operators
  6. Shift operators: understand the difference between arithmetic and logical shifts
  7. Representation of integers: 2's complement, 1s' complement, sign-magnitude (less than 1 minute for 16 bits)
  8. Casting between signed and unsigned (less than a minute in hexadecimal or binary)
  9. Casting between integers of different sizes and sign extension (less than a minute in hexadecimal or binary)
  10. unsigned addition and subtraction
  11. signed addition and subtraction: 2's complement only
  12. unsigned multiplication
  13. 2's complement multiplication
  14. Multiplying by constants using shift, add, and subtract (1 minute)
  15. Dividing by powers of 2 (as fast as you can write, if in binary)
  16. Fractional binary numbers - converting between base 2 and base 10 (15 seconds per bit)
  17. IEEE floating point format with given number of exp and frac bits
    See the summary here
    For given number of exp and frac bits: (each should take less than a minute)
    1. find the bias
    2. find smallest denormalized greater than 0
    3. find largest denormalized
    4. find smallest normalized greater than 0
    5. find largest normalized
    6. Given the binary:
      • find the sign, exp, and frac bits
      • determine whether it is nan, inf, denormalized, or normalized
      • find the value
    7. Given a value:
      • determine whether it will be represented as denormalized, normalized, or infinity (15 seconds once you have done b), c), d) and e)
      • find the representation
  18. Understand the four rounding methods (given value and rounding method, determine what it rounds to in under 30 seconds)

Back to CS 3843 Homepage