1|Page
EXAM 2 COP4610 FSU WANG |
ACTUAL EXAM WITH VERIFIED
ANSWERS 2025
Segmentation-based translation - correct-answer-Use a table of base-and-bound
pairs
Paging-based translation - correct-answer-Memory allocation via fixed-size chunks
of memory, or pages
Segmented-paging translation - correct-answer-breaks the page table into
segments
Paged page tables - correct-answer-Two-level tree of page tables
Caching - correct-answer-Stores copies of data at places that can be accessed
more quickly than accessing the original
,2|Page
Temporal locality - correct-answer-recently referenced locations are more likely to
be referenced soon
Spatial locality - correct-answer-referenced locations tend to be clustered
(cache pollution) - correct-answer-Leaves behind cache content with no localities
Virtually addressed cache: - correct-answer-between the CPU and the translation
tables
Physically addressed cache - correct-answer-Between the translation tables and
the main memory
Design issues of caching - correct-answer-1. How is a cache entry lookup
performed?
2. Which cache entry should be replaced when the cache is full?
3. How to maintain consistency between the cache copy and the real data?
, 3|Page
Four types of cache misses - correct-answer-1. Compulsory misses: data brought
into the cache for the first time
2. Capacity misses: caused by the limited size of a cache
3. Misses due to competing cache entries: a cache entry assigned to two pieces of
data
4. Policy misses: caused by cache replacement policy, which chooses which cache
entry to replace when the cache is full
Ways to perform TLB lookups - correct-answer-1. Direct mapping: assigns each
virtual page to a specific slot in the TLB
2. Set associativity: use N TLB banks to perform lookups in parallel
3. Fully associative cache: allows looking up all TLB entries in parallel
Write-through vs. write-back policies - correct-answer-Write-through:
immediately propagates update through various
levels of caching
-For critical data
Write-back: delays the propagation until the cached item is replaced
-Goal: spread the cost of update propagation over multiple updates
-Less costly
EXAM 2 COP4610 FSU WANG |
ACTUAL EXAM WITH VERIFIED
ANSWERS 2025
Segmentation-based translation - correct-answer-Use a table of base-and-bound
pairs
Paging-based translation - correct-answer-Memory allocation via fixed-size chunks
of memory, or pages
Segmented-paging translation - correct-answer-breaks the page table into
segments
Paged page tables - correct-answer-Two-level tree of page tables
Caching - correct-answer-Stores copies of data at places that can be accessed
more quickly than accessing the original
,2|Page
Temporal locality - correct-answer-recently referenced locations are more likely to
be referenced soon
Spatial locality - correct-answer-referenced locations tend to be clustered
(cache pollution) - correct-answer-Leaves behind cache content with no localities
Virtually addressed cache: - correct-answer-between the CPU and the translation
tables
Physically addressed cache - correct-answer-Between the translation tables and
the main memory
Design issues of caching - correct-answer-1. How is a cache entry lookup
performed?
2. Which cache entry should be replaced when the cache is full?
3. How to maintain consistency between the cache copy and the real data?
, 3|Page
Four types of cache misses - correct-answer-1. Compulsory misses: data brought
into the cache for the first time
2. Capacity misses: caused by the limited size of a cache
3. Misses due to competing cache entries: a cache entry assigned to two pieces of
data
4. Policy misses: caused by cache replacement policy, which chooses which cache
entry to replace when the cache is full
Ways to perform TLB lookups - correct-answer-1. Direct mapping: assigns each
virtual page to a specific slot in the TLB
2. Set associativity: use N TLB banks to perform lookups in parallel
3. Fully associative cache: allows looking up all TLB entries in parallel
Write-through vs. write-back policies - correct-answer-Write-through:
immediately propagates update through various
levels of caching
-For critical data
Write-back: delays the propagation until the cached item is replaced
-Goal: spread the cost of update propagation over multiple updates
-Less costly
