edited by
15,275 views
35 35 votes

Locality of reference implies that the page reference being made by a process

  1. will always be to the page used in the previous page reference

  2. is likely to be to one of the pages used in the last few page references

  3. will always be to one of the pages existing in memory

  4. will always lead to a page fault

3 Answers

Best answer
42 42 votes

Answer is (B)

Locality of reference is also called as principle of locality.  It means that same data values or related storage locations are frequently accessed.  This in turn saves time.  There are mainly three types of principle of locality:

  1. temporal locality
  2. spatial locality
  3. sequential locality


This is required because in programs related data are stored in consecutive locations and in loops same locations are referred again and again

edited by
2 2 votes

Locality of reference means that when a computer is working on something, it often sticks to using the same information or nearby information over and over again for a short period of time.

  • Temporal locality: The computer is likely to use the same thing again soon.
  • Spatial locality: The computer is likely to use things that are next to each other.

This helps the computer be quicker because it doesn't have to search far for what it needs.

Answer:
Position:
Show:

Related questions

49 49 votes
4 answers 4 answers
17.4k
17.4k views
Kathleen asked Sep 29, 2014
17,374 views
Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above
44 44 votes
5 answers 5 answers
21.0k
21.0k views
Kathleen asked Sep 29, 2014
20,974 views
Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimprove the system performance
41 41 votes
5 answers 5 answers
15.8k
15.8k views
Kathleen asked Sep 29, 2014
15,756 views
Which one of the following is not decidable?Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ stepsEquivalence of two given Turing m...
27 27 votes
3 answers 3 answers
8.7k
8.7k views
Kathleen asked Sep 29, 2014
8,679 views
The correct matching for the following pairs is $$\begin{array}{|ll|ll|}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} ...