Computer Sciences > Gate 2020 > Memory Management
A computer system with a word length of 32 bits has a 16 MB byte- addressable main memory and a 64 KB, 4-way set associative cache memory with a block size of 256 bytes. Consider the following four physical addresses represented in hexadecimal notation.

A1 = 0x42C8A4
A2 = 0x546888
A3 = 0x6A289C
A4 = 0x5E4880

Which one of the following is TRUE ?
A
A1 and A4 are mapped to different cache sets.
B
A2 and A3 are mapped to the same cache set.
C
A3 and A4 are mapped to the same cache set.
D
A1 and A3 are mapped to the same cache set.

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science