Quiz
CPSC 313 Unit 3 Memory MIDTERM COVERAGE
This quiz has question types that open in the usual player.
Questions in this quiz (9)
1Build the Memory Hierarchy!
L0: [blank_start]Registers[blank_end]
L1: [blank_start]L1 cache[blank_end] ([blank_start]SRAM[blank_end])
L2: [blank_start]L2 cache[blank_end] (SRAM)
L3: [blank_start]Main memory[blank_end] ([blank_start]DRAM[blank_end])
L4: [blank_start]Local secondary storage[blank_end] ([blank_start]local disks[blank_end])
L5: [blank_start]Remote secondary storage[blank_end] (tapes, web servers, distributed file systems)
L0 to L2 is [blank_start]smaller, faster, costlier[blank_end] per byte
L3 to L5 is [blank_start]larger, slower, cheaper[blank_end] per byte- ARegisters
- BL0 cache
- CL1 cache
- DL2 cache
- EMain memory
- FLocal secondary storage
- GRemote secondary storage
- HSRAM
- IDRAM
- Jlocal disks
- Ksmaller, faster, costlier
- Llarger, slower, cheaper
- MRRAM
- NL3 cache
- OL4 cache
- PL5 cache
2Static RAM is smaller, faster, and costlier per byte
- ATrue
- BFalse
3DRAM is smaller, faster, cheaper per byte
- ATrue
- BFalse
4Reference locality exists when data or code accesses tend to be near each other [blank_start]temporally[blank_end] or [blank_start]spatially[blank_end]
- Atemporally
- Bspatially
- Creferentially
- Dlocally
- Esparingly
- Fsparsely
- Gmoderately
- Hdensely
5[blank_start]Temporal[blank_end] locality exists when there are multiple accesses to the same memory within a short interval
- ATemporal
- BReferential
- CTrump
- DClinton
- ESpatial
6Caches are small storage devises that store subsets of larger storage devices
- ATrue
- BFalse
7Prefetching fetches data into the cache after it is accessed
- ATrue
- BFalse
8A cache hit is an access that [blank_start]can[blank_end] be satisfied by a cache while is miss is an access that [blank_start]cannot[blank_end] be satisfied by a cache
- Acan
- Bcannot
9How do we handle cache misses?
- APropogate down hierarchy, stop at hit in lower level, propagate back up and add data to each cache on the way
- BPropogate down hierarchy, stop at hit in lower level, propagate back up
- CPropogate up hierarchy, stop at hit in higher level, propagate back down and add data to each cache on the way
- DPropogate up hierarchy, stop at hit in higher level, propagate back down
Information
- Description
- Computer Science Quiz on CPSC 313 Unit 3 Memory MIDTERM COVERAGE, created by Zim Brightwood on 22/10/2016.
- Author
- Zim Brightwood
- Language
- English
- Views
- 17
- History
- Created on 22 Oct 2016 · updated on 5 Jan 2017
- Tags
- Rating
- No ratings yet Rate this quiz