Test #4 Review Sheet
Here's a review sheet for the fourth test, aka, the final exam. The
ommission of a topic does not mean it is not on the test. You are
responsible for all the class lectures, all the homework assignments,
and all the labs.
You should look over previous review sheets. More importantly, you
should study your homework problems. At this point you have a feel for how
Dr. Hunt assigns problems. 66% of his problems are just like homework
problems, except he changes the numbers. The remaining third are usually
related to homework assignments but require a deeper understanding of the
assignments.
For your convinience, here are links to the three previous review
sheets:
Topics that I think we've covered in detail and should be on the final exam:
- Caches
- Direct-mapped (same thing as 1-way set associative)
- N-way set-associative
- Memory Heirarchy
- Dynamic memory
- malloc
- free
- reallco
- What is the payload? What is fragmentation?
- Virtual memory
- Why do we have virtual memory?
- How to translate: page 23 and 25 of class19.pdf. Example on page
32 of class19.pdf
- Translation Lookaskide Buffer (TLB): page 30 of class 19.pdf
- Instruction level parallelism.
- How does having 4 integer ALU's affect your cycles per element
(CPE)?
- Loop unrolling
- Logic Design
- Selector/MUX
- Bit equality checker
- Storing 1 bit: slides 15-18 in class2-logic.pdf
- HCL will NOT be on the test
- X86
- Signed and unsigned jumps
- Assembly, leal, movl, other instructions on the slides
- GCC protocol for calling functions on the X86
- Register caller/callee-save conventions
- I'm sure there's more that can go on this list.
- Y86
- See X86 list above
- Converting X86 to Y86
- Floating Point: be ready for a different format than the earlier
tests.
- Bit manipulation, like in Lab1.
- The list goes on.... Look at the topics covered by the slides.
Home