Skip to main content
3 votes
Accepted

When a CPU copies instructions from storage into RAM how does it jump to instructions no longer in RAM?

You have many memory pages - thousands 20 years ago, possibly millions today. When the next instruction is not in RAM, it is loaded for example from disk. Some other page of memory will be thrown out. ...
gnasher729's user avatar
  • 31.1k
3 votes
Accepted

Which searching technique will cause lesser number of page fault?

Your assumption is wrong. If all data is in memory then there are no page faults. Now assume you have 100 pages, none in memory. Linear search will have on average 50 page faults. Binary search will ...
gnasher729's user avatar
  • 31.1k
1 vote
Accepted

Are they talking about virtual memory in this article?

Yes, the first paragraph is also talking about virtual memory concepts. It describes how to translate virtual addresses (used by programs) into physical addresses in the main memory. The page table ...
proof-of-correctness's user avatar
1 vote

Which searching technique will cause lesser number of page fault?

One approach is Eytzinger layout, which is essentially a breadth-first traversal of the binary search "tree". The idea is that the items that would be visited first in binary search are ...
Pseudonym's user avatar
  • 22.6k

Only top scored, non community-wiki answers of a minimum length are eligible