Cache memory of COA| UGC NET|GATE

Cache memory of COA| UGC NET|GATE

Q1➡ |
If Cache Size is 64KB, Block size is 32B and the cache is Two-Way Set Associative. For a 32-bit physical address, the division between Block Offset, Index and Tag are:
i ➥ 5 bits, 10 bits , 17 bits
ii ➥ 32 bits, 64 bits, 22 bits
iii ➥ 17 bits, 32 bits, 16 bits
iv ➥ 10 bits, 10 bits, 10 bits

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q2➡ |
If flexibiLity is defined as having maximum choice in cache placement, which of the following is correctly ordered in ascending order of flexibility?
i ➥ Set-Associative Mapping, Direct Mapping, Associative Mapping
ii ➥ Associative Mapping, set-Associative Mapping, Direct Mapping
iii ➥ Direct Mapping, set-Associative Mapping, Associative Mapping
iv ➥ None of the Above

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q3➡ |
Consider a machine with a byte addressable main memory of 2616 bytes and block size of 8 bytes. Assume that a direct mapped cache consisting of 32 lines is used with this machine. How many bits will be there in Tag, line and word field of format of main memory addresses?
i ➥ 7,6,3
ii ➥ 7,5,4
iii ➥ 8,6,2
iv ➥ 8,5,3

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q4➡ |
A direct mapped cache is of size 32 KB and has block size 32 Bytes. CPU also generates 32 bit address. Number of bits needed for indexing the cache:
i ➥ 10
ii ➥ 14
iii ➥ 15
iv ➥ 17

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q5➡ |
A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The number of bits in the tag field of an address is.
i ➥ 15
ii ➥ 25
iii ➥ 14
iv ➥ 11

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q6➡ |
A 64kB direct mapped cache has 16 byte blocks. If the address is of 32 bit, how many bits are used for tag, index and offset in this cache?
i ➥ 16,14,4
ii ➥ 16,13,4
iii ➥ 12,16,4
iv ➥ 16,12,4

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q7➡ |
A computer system has a RAM of 4 GB and a cache of 512MB. Assuming that the least significant bit is b0 ,the cache location using direct mapping is given by.
i ➥ the bits b28. . .b0
ii ➥ the bits b31.. .b29
iii ➥ the bits b2. . .b0
iv ➥ the bits b31. . .b4

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q8➡ |
Consider a cache memory organization with m lines in which the cache is divided into v sets, each of which consists of k lines. The set associative mapping technique reduces to direct mapping when:
i ➥ v=1 and k=1
ii ➥ v=m and k=m
iii ➥ v=1 and k=m
iv ➥ v=m and k=1

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q9➡ |
How many total bits are required for a direct-mapped cache with 128 KB of data and 1 word block size, assuming a 32-bit address and 1 word size of 4 bytes?
i ➥ 1.7 Mbits
ii ➥ 2 Mbits
iii ➥ 2.5 Mbits
iv ➥ 1.5 Mbits

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q10➡ |
The principle of locality of reference justifies the use of
i ➥ cache memory
ii ➥ secondary memory
iii ➥ virtual memory
iv ➥ interrupts

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q11➡ |
The main memory of a computer has 2cm blocks while the cache has 2c blocks. If cache uses set associative mapping scheme with two blocks per set, then the block k of the main memory maps to set.
i ➥ (k mod 2cm) of the cache
ii ➥ (k mod 2c) of the cache
iii ➥ (k mod c) of the cache
iv ➥ (k mod m) of the cache

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q12➡ |
A computer system has 4k word cache organized in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in the SET and WORD fields of the main memory address format is
i ➥ 4, 6
ii ➥ 7, 2
iii ➥ 6, 4
iv ➥ 15, 4

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q13➡ |
A page table is maintained partially in cache memory with a hit ratio of 80%. Give the following, what is the Effective Access Time. Cache lookup takes 5 nanosec and memory access time is 100 nanosec.
i ➥ 105 nanosec
ii ➥ 125 nanosec
iii ➥ 45 nanosec
iv ➥ 25 nanosec

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q14➡ |
The disadvantage of write back strategy in cache is that.
i ➥ Portions of main memory may be invalid
ii ➥ It requires local cache memory attached to every CPU in a multi processor environment
iii ➥ It creates a write mechanism whenever there is a write operation to cache
iv ➥ If generates repeated memory traffic

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q15➡ |
Cache memory is.
i ➥ Low-Speed RAM
ii ➥ High-speed RAM
iii ➥ High-Speed Register
iv ➥ Non-Volatile RAM

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q16➡ |
The____________memory is intended to give memory speed approaching that of the fastest memories available, and at the same time provide a large memory size at the price of less expensive types of semiconductor memories
i ➥ Flip flop
ii ➥ Register
iii ➥ cache
iv ➥ Counter

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q17➡ |
Which of the following memory improves the speed of execution of a program?
i ➥ Cache memory
ii ➥ Secondary memory
iii ➥ Primary memory
iv ➥ Virtual memory

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q18➡ |
A digital computer has a memory unit of 64k x 16 and a cache memory of 210 words. The cache uses Direct mapping with a block size of four words. How many bits are there in the tag, index and block Fields of address format?
i ➥ 6, 8, 2
ii ➥ 24
iii ➥ 28
iv ➥ 1, 6, 16

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q19➡ |
More than one word are put in one cache block to
i ➥ reduce the miss penalty
ii ➥ exploit the spatial locality of reference in a program
iii ➥ exploit the temporal locality of reference in a program
iv ➥ None of the above

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q20➡ |
A computer system has a level-1 instruction cache (1-cache), a level-1 data cache (D-cache) and a level-2 cache (L2-cache) with the following specifications:


The length of the physical address of a word in the main memory is 30 bits. The capacity of the tag memory in the I-cache, D-cache and L2-cache is, respectively,
i ➥ 1K × 18-bit, 1K × 19-bit, 4K × 16-bit
ii ➥ 1K × 16-bit, 1K × 19-bit, 4K × 18-bit
iii ➥ 1K × 18-bit, 512 × 18-bit, 1K × 18-bit
iv ➥ 1K × 16-bit, 512 × 18-bit, 1K × 16-bit

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q21➡ |
Consider a computer with a 4-ways set-associative mapped cache of the following characteristics: a total of 1 MB of main memory, a word size of 1 byte, a block size of 128 words and a cache size of 8 KB. The number of bits in the TAG, SET and WORD fields, respectively are:
i ➥ 9, 4, 7
ii ➥ 8, 6, 6
iii ➥ 7, 6, 7
iv ➥ 8, 5, 7

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q22➡ |
Consider a computer with a 4-ways set-associative mapped cache of the following characteristics: a total of 1 MB of main memory, a word size of 1 byte, a block size of 128 words and a cache size of 8 KB. While accessing the memory location 0C795H by the CPU, the contents of the TAG field of the corresponding cache line is.
i ➥ 110001111
ii ➥ 00011000
iii ➥ 110010101
iv ➥ 000011000

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q23➡ |
Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU generates 32 bit addresses. The number of bits needed for cache indexing and the number of tag bits are respectively.
i ➥ 10, 22
ii ➥ 5, 17
iii ➥ 15, 17
iv ➥ 10, 17

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q24➡ |
Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generates a 20-bit address of a word in main memory. The number of bits in the TAG, LINE and WORD fields are respectively:
i ➥ 9, 5, 6
ii ➥ 9, 6, 5
iii ➥ 7, 7, 6
iv ➥ 7, 5, 8

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q25➡ |
Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in the following order:
0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155.
Which one of the following memory block will NOT be in cache if LRU replacement policy is used?
i ➥ 129
ii ➥ 3
iii ➥ 216
iv ➥ 8

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q26➡ |
For inclusion to hold between two cache levels L1 and L2 in a multi-level cache hierarchy, which of the following are necessary?
I. L1 must be a write-through cache
II. L2 must be a write-through cache
III. The associativity of L2 must be greater than that of L1
IV. The L2 cache must be at least as large as the L1 cache
i ➥ I and IV only
ii ➥ I, III and IV only
iii ➥ I, II, III and IV
iv ➥ IV only

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q27➡ |
A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.
The number of bits in the tag field of an address is
i ➥ 26
ii ➥ 16
iii ➥ 14
iv ➥ 11

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q28➡ |
A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.
The size of the cache tag directory is.
i ➥ 32 Kbits
ii ➥ 40 Kbits
iii ➥ 136 Kbits
iv ➥ 160 Kbits

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q29➡ |
In designing a computer’s cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?
i ➥ A smaller block size incurs a lower cache miss penalty
ii ➥ A smaller block size implies a larger cache tag and hence lower cache hit time
iii ➥ A smaller block size implies a smaller cache tag and hence lower cache tag overhead
iv ➥ A smaller block size implies better spatial locality

Answer- I

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line
Q30➡ |
If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
i ➥ Width of way selection multiplexor
ii ➥ Width of processor to main memory data bus
iii ➥ Width of set index decoder
iv ➥ Width of tag comparator

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q31➡ |
In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from.
i ➥ (j mod k) * v to (j mod k) * v + (v-1)
ii ➥ (j mod k) to (j mod k) + (v-1)
iii ➥ (j mod v) to (j mod v) + (k-1)
iv ➥ (j mod v) * k to (j mod v) * k + (k-1)

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q32➡ |
A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is __.
i ➥ 19
ii ➥ 20
iii ➥ 22
iv ➥ 23

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q33➡ |
Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processors read requests result in a cache hit. The average and access time in nanoseconds is_______-.
i ➥ 17
ii ➥ 16
iii ➥ 15
iv ➥ 14

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q34➡ |
Consider a machine with a byte addressable main memory of 232 bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is _.
i ➥ 19
ii ➥ 18
iii ➥ 21
iv ➥ 20

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q35➡ |
The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is _ bits.
i ➥ 27
ii ➥ 26
iii ➥ 24
iv ➥ 23

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q36➡ |
A cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16-way set-associative cache, the length of the TAG field is___ bits.
i ➥ 17
ii ➥ 16
iii ➥ 15
iv ➥ 14

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q37➡ |
A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
i ➥ 24 bits and 0 bits
ii ➥ 28 bits and 4 bits
iii ➥ 28 bits and 0 bits
iv ➥ 24 bits and 4 bits

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q39➡ |
Consider a 2-way set associative cache with 256 blocks and uses LRU replacement. Initially the cache is empty. Conflict misses are those misses which occur due to contention of multiple blocks for the same cache set. Compulsory misses occur due to first time access to the block. The following sequence of accesses to memory blocks
(0, 128, 256, 128, 0, 128, 256, 128, 1, 129, 257, 129, 1, 129, 257, 129)
is repeated 10 times. The number of conflict misses experienced by the cache is __.
i ➥ 81
ii ➥ 80
iii ➥ 79
iv ➥ 76

Answer- IV

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q40➡ |
Consider a Direct Mapped Cache with 8 cache blocks (numbered 0-7). If the memory block requests are in the following order
3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24.
Which of the following memory blocks will not be in the cache at the end of the sequence?
i ➥ 13
ii ➥ 15
iii ➥ 18
iv ➥ 30

Answer- III

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q41➡ |
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is 8, 12, 0, 12, 8
i ➥ 5
ii ➥ 4
iii ➥ 3
iv ➥ 2

Answer- II

More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Cache memory of COA| UGC NET|GATE

Leave a Reply

Your email address will not be published.

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?