- 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.
- You may not use a calculator (such as a cell phone) that can access a network.
The instructions for the exam will be as follows:
This is a closed book exam. You may use a calculator, as long as it is
not capable of accessing a network. No cell phones.
This is a 50-minute exam. The questions are divided into 2 parts.
The first part is worth 80 points. Everyone should be able to finish Part 1.
Part 2 is worth 20 points.
If you cannot do the questions are Part 1 quickly, you may not have time
to finish Part 2.
Put your answers in the space provided. You must show your work to get credit.
If you cannot fit your answers in the space provided, you may continue on the back of the exam.
You will be given a page of diagrams to refer to for this exam.
Do not turn in this sheet. You can keep it for reference or throw it away. You may use the back as scratch paper,
but nothing on this sheet will be graded.
You are responsible for understanding all of assignments and material
from the textbook.
The exam will cover Appendix B.
Many of the problems on the exam will be similar to
recitation problems
and the
daily questions.
Appendix B
- Cache terminology: hit, miss, hit ratio (or hit rate), miss ratio (or miss rate), miss penalty
- Memory Hierarchy: registers, cache, main memory, disk
- Access time and transfer rate
- Calculating CPI with cache misses
- Block Placement, Block Identification, Block Replacement, Write Strategy
- Cache associativity
- Block offset, index, and tag
- Write-back, write-through, write allocate, no-write allocate
- Cache performance: unified and split caches
- Cache optimization techniques
- Multilevel caches
- Virtual memory: paging only
- Virtual address, physical address, page, frame
- Address translation
- Page table, TLB
- Multilevel page tables
- Figures
B.17 and
B.25.
A blank figure for the exam.
- Relationship between cache design and virtual memory design:
- physically indexed and tagged caches
- virtually indexed, physically tagged caches
- virtually indexed and tagged caches
Know the advantages and disadvantages of these.
countdown to exam start
countdown to exam end
Back to CS 3853 Homepage