Exam 1 Practice Questions
=========================

1) What's the binary pattern for TMIN and TMAX?
   Assuming w-bit words, what's the value of TMIN and TMAX?

2) What's the binary pattern for UMIN and UMAX?
   Assuming w-bit words, what's the value of UMIN and UMAX?

3) Suppose we are dealing with 5-bit words (w = 5).
   What is B2U(1 1010)?
   What is B2T(1 1010)?

4) What is the result of ! ((x + 1) & x) if x = 5?
   Know all the bitwise and logical operators. 

5) Suppose x is a signed byte and set to 1011 1011.
   What is x >> 3?
   Does this correctly divide by 8?
   If it does not, how can we fix this?

6) Let's imagine that Samsung just released a 4 nm process. Assuming
they want to ensure they keep pace with Moore's Law, what should their
next node be, and what was the one prior to 4 nm? Keep one digit
beyond the decimal point.

7) Know every component of Moore's Law.

8) Review the IAS homework and how we summed two arrays.
   Know the registers, like MAR, MBR, AC, IR, and PC.
   How is data stored? How are instructions stored?
   What is a LOAD vs a STOR? 

9) What is 6 * -7, assuming 4-bit signed words?
   What is 6 * 9,  assuming 4-bit unsigned words?
   Compare the binary to the expected result.

10) How is sand used to make a chip?
    Touch on at least four steps.

11) We can view a computer system as a series of layers.
    What are they?

12) How are the different generations of computers defined?
    What's the significance of Babbage, von Neumann, Moore,
    ENIAC, IAS, x86, and A7?

13) Suppose x is a signed integer. I want to take bits 7 through 13
(inclusive) of x and place them in the low bits of y. How can I do
this with bitwise operators?

14) Review the performance problems we discussed. Most problems use an
equation which is a variation of T = IC * CPI * tau or P = L * V^2 *
f.