Q.1 Which type of caching can be used to cache the contest registration page in a website, to reduce the time taken to display the page for the users?
A. Application Cache
B. Web Cache
C. Browser Cache
D. Data Cache
Ans : Application Cache
Q.2 A cache is a ______________.
A. Data backup
B. Small and fast memory
C. Copy of data
D. Data storage format
Ans : Small and fast memory
Q.3 In which type of cache does the application treats cache as the main data store, reads data from it and writes data to it?
(I) Read Through/Write Through Cache
(II) Cache-aside
A. I
B. II
C. I and II
D. None of the options
Ans : I
Q.4 In which type of cache does the application directly interacts with database for data that is not available in the cache?
A. Write Through Cache
B. Local Cache
C. Cache-aside
D. Read Through Cache
Ans : Cache-aside
Q.5 Which of the following is true about the cache?
A. Line size > Block size
B. Line size == Block size
C. Line size < Block size
D. None of the options mentioned
Ans : Line size == Block size
Q.6 Which type of cache is recommended to store user preferences for an application with several 100s of concurrent users?
A. Primed Cache
B. Near Cache
C. On Demand Cache
D. Data Cache
Ans : On Demand Cache
Q.7 A web page displays ten items per page and has pagination enabled. What would be the recommended way to enable efficient paging?
A. Use Temporal Cache
B. Perform in-memory paging
C. Use Spatial Cache
D. Hit the database every time the user moves to the next page
Ans : Use Spatial Cache
Q.8 The primary objective of Cache Coherence is to ensure __________.
A. Improved Cache Resilience
B. Data Consistency across all local caches
C. Improved Cache Performance
Ans : Data Consistency across all local caches
Q.9 While using a Write Back cache, which of the following policies needs to be abided?
A. Write Allocate
B. Write Through
C. No Write Allocate
D. Write Around
Ans : Write Allocate
Q.10 Which type of cache reference locality aims at designing cache to store Recently Referenced Data assuming that the same data will be requested frequently?
A. Either Temporal or Spatial
B. Spatial Locality
C. Temporal Locality
D. None of the options
Ans : Temporal Locality
Q.11 Line size in a cache is recommended to be a power of 2.
A. True
B. False
Ans : True
Q.12 A byte addressable direct-mapped cache has 1024 blocks/lines, with each block having eight 32-bit words. How many bits are required for block offset, assuming a 32-bit address?
A. 5
B. 15
C. 10
D. 3
Ans : 5
Q.13 For a cache look up to be a Hit, which of the following must be true?
A. Tag==Block Offset and Valid Bit = 0
B. Tag==Block Number and Valid Bit = 1
C. Tag==Block Offset and Valid Bit = 1
D. Tag==Block Number and Valid Bit = 0
Ans : Tag==Block Number and Valid Bit = 1
Q.14 When a computer processor does not get a data item that it requires in the cache, it is known as _________.
A. Cache Miss
B. Write Miss
C. Cache Read
D. Cache Hit
Ans : Cache Miss
Q.15 Which would be the best place to cache DNS data?
A. Browser
B. Application
C. Data
D. Proxy
Ans : Proxy
Q.16 Which of the following Cache Eviction techniques consider Locality?
A. First in First Out
B. Time Based
C. Least Recently Used
D. Random
Ans : Least Recently Used
Q.17 Which of the following is used to determine if a piece of data that needs to be written back to the cache?
A. Dirty Bit = 1
B. Valid Bit = 0
C. Valid Bit = 1
D. Dirty Bit = 0
Ans : Dirty Bit = 1
Q.18 The Caching Technique where the cache is populated the first time a particular piece of data is requested is called _________.
A. Lazy Loading
B. Upfront Loading
C. Cache aside
D. Local Population
Ans : Lazy Loading
Q.19 Which Caching Topology is recommended for a read intensive distributed application?
A. Local Cache
B. Replicated
C. Near Cache
D. Partitioned
Ans : Replicated
Q.20 A cache has 1024 blocks, and each block can contain 1024 bits of data. What is the size of the cache?
A. 0.25 MB
B. 1 MB
C. 0.125 MB
D. 0.5 MB
Ans : 0.125 MB
Q.21 Which of the following topologies implement afront cache and a back cache that automatically and transparently communicate with each other by using a read-through/write-through approach?
A. Replicated
B. Local Cache
C. Near Cache
D. Partitioned
Ans : Near Cache
