A. Binary Search tree
B. Caching
C. Spatial locality
D. Scheduling of Processes

Solution

C. Spatial locality

Explanation

The answer is c, i.e., Spatial locality. Here, spatial locality means that the instruction accessed recently, then the nearby memory location would be accessed in the next iteration. As we know that in an array, all the elements are stored in a contiguous block of memory, so spatial locality is accessed quickly.