Subjects to know for exam in MIPS
For the final exam, know these pages from book, 3rd edition revised.
* indicates more critical stuff
- *chap. 2.2 -2.9 pp. 49-105
- pp. 106 -120 are good too but less important
- *pp.121 -130
- *chap 3.2 - 3.6 pp. 160 - 213
- *chap 4.1 - 4.2 pp. 240- 253
- 5.1 - 5.4 pp.284 - 317 necessary but less important
- * 5.5 pp. 318 - 331
- 7.1 468- 472
- *7.2 -7.3 473 - 510
CPU Time in cycles = number of instructions * average clock cycles per instruction (CPI)
Runtime = (cycles)/(clock rate per second (ghz))
- What will be the value of a wire at one of the 5 stages in a multicycle datapath.
(Based on the YouTube video with Muhammad). p. 318 in the book.(3rd edition).
- Improving performance (clock-cycle) problem. p. 247 in the book (3rd edition).
- Write some type of a function, with a user interface (in Mars) using all the function rules
(store/load all the $s registers). An example of such a problem would be a function to find the
largest number in a series. p.79 in the book for explanation of functions in MIPS and p. A-43
for an intro to syscalls (needed to create a user interface). More information on syscalls
can be found in the Help (f1) section in the Mars program. When you open help,
there is a tab there "syscalls".
- Represent a floating point number in a single or double precision floating point
representation. Know the bit breakdown for single and double precision commands.
- Know how to express the following MIPS commands in binary notation: sw (store word), lw (load word), add, j (jump),
beq/bne (branch if equal/not equal). And know how to read a binary set of 32 bits and be able to tell which
of those 5 commands it performs. p.60-68
- Bits in a cache question. An example of this type of question that will be asked appears on p.479
- Locating a block in the cache question. An example of this type of question appears on p.480.
- Understand the difference and advantages/disadvantages of set-associative vs. fully-associative
vs. direct mapped caches. p.497.
- Given one of the 5 commands that we have to know (sw, lw, add, j, beq) what will be the value
of a wire at one of the 5 stages in a multicycle datapath. (Based on the YouTube video with Muhammad).
p. 318 in the book.