• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

ISRO | ISRO CS 2017 | Question 38

A CPU has a 32 KB direct mapped cache with 128 byte block size. Suppose A is a 2 dimensional array of size 512×512 with elements that occupy 8 bytes each. Consider the code segment
for (i =0; i < 512; i++) {
  for (j =0; j < 512; j++) {
    x += A[i][j];
  }
} 
Assuming that array is stored in order A[0][0], A[0][1], A[0][2]……, the number of cache misses is

(A)

16384

(B)

512

(C)

2048

(D)

1024

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments