I am confident that all my answers are right.
Section 1
=======
1. ? --- absolutely no clue how to do it
2. E
3. C
4. B
5. B
6. C
7. D
1. no idea
2. 0.5 (because 2^-1 is 1/2 = 0.5) === .1 in binary
3.
0110.101 ; 1001.011
for negative numbers you do -7 + 0.375 (take ones complement for negative)
4.do the K-map thing and reduce. (if you want to try it out, use m0, m1, m4, m5, m7)
5. just make a truth table. cross out the combinations where B = 1. that removes 4 combinations from 8. leaving 4 combinations.
6. A+W(I+U-L) ------ U-L = 0. so it's just I*W + A. makes sense. starting point plus index*wordsize.
7. 500/4 = 125. 750/3 = 250. clocks/sec DIV clocks == instructions per second.