Virtual Memory and Page Replacement Questions and Answers

Q: Page Fault occurs when

A page fault occurs when the page is not in RAM.In virtual memory, a program's pages may be in main memory or on disk. When the CPU references a page whose page-table entry is marked invalid (not present), the hardware raises a page fault. The OS then finds the page on disk, loads it into a free frame (evicting another page if needed), updates the page table and restarts the instruction.If the page is in RAM, the access proceeds normally with no fault. A locked page is pinned in memory precisely so that it never faults. Pages are not swapped out 'manually' by programs; and it is the later access to a page that has been moved out that causes the fault, not the moving itself.

Q: Which of the following is a technique used in virtual memory management ?

A technique used in virtual memory management is Paging.Paging divides a process's logical memory into fixed-size pages and physical memory into frames of the same size, so pages can be loaded on demand and placed anywhere. This lets a program larger than physical memory run.Scheduling decides which process runs on the CPU, fragmentation is a problem of memory allocation rather than a technique, and time-sharing is a way of sharing the CPU among users.

Q: What is thrashing in virtual memory systems ?

Thrashing is excessive page faults.When the processes running do not have enough frames for their working sets, nearly every memory reference causes a page fault. The system spends most of its time swapping pages in and out and very little doing useful work, so CPU utilisation collapses. Raising the degree of multiprogramming then makes it worse.Heavy disk I/O is a symptom of thrashing, not its definition, and the CPU is under-used during thrashing rather than over-used. Memory fragmentation is a separate problem of unusable gaps in memory.

Q: In the Least Recently Used (LRU) page replacement algorithm, which page is selected for replacement ?

LRU replaces the page that was least recently accessed.LRU assumes that a page not used for a long time is unlikely to be used soon, using the recent past to predict the near future. On a page fault it evicts the page whose last use is furthest in the past, tracked with counters or a stack of page numbers.Replacing the page that will not be used for the longest time is the optimal (OPT or Belady) algorithm, which needs knowledge of the future. Replacing the page that has been in memory longest is FIFO. Priority-based replacement is not LRU.

Q: Suppose the time to service a page fault is on average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in an average memory access time of

The average access time is 1.9999 microseconds.Weight each case by its probability, working in microseconds (10 ms = 10,000 µs):\[ \begin{aligned} t &= 0.9999 \times 1 + 0.0001 \times 10000 \\ &= 0.9999 + 1 = 1.9999\ \mu\text{s} \end{aligned} \]The milliseconds options mix up the units by a factor of 1000. 9.999 microseconds would follow from a 99.9% hit ratio, ten times as many faults.

Q: What is the number of page hits in LRU (Least Recently Used) page replacement policy in a system with 3 page frames and 8 pages with the reference string 0172327103 ? Assume 3 frames are initially empty.

There are 2 page hits.Trace the string 0 1 7 2 3 2 7 1 0 3 with three frames, replacing the least recently used page on each miss.RefFramesResult0, 1, 70 1 73 misses22 1 7 (0 out)miss32 3 7 (1 out)miss22 3 7hit72 3 7hit12 1 7 (3 out)miss00 1 7 (2 out)miss30 1 3 (7 out)missOnly the references to 2 and 7 in the middle find their page already loaded, so there are 2 hits and 8 faults. Evicting by arrival order (FIFO) instead of last use would give 3 hits, the usual trap; 4 and 5 match no replacement rule here.

Q: Consider the following page trace : 4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m = 4 will be

The page faults are 10.FIFO with four frames, trace 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. The first four references 4, 3, 2, 1 load the empty frames, which makes 4 faults. The next 4 and 3 are hits.\[ 5 \to \text{fault (evict 4)} \]\[ 4 \to \text{fault (evict 3)} \]\[ 3 \to \text{fault (evict 2)} \]\[ 2 \to \text{fault (evict 1)} \]\[ 1 \to \text{fault (evict 5)} \]\[ 5 \to \text{fault (evict 4)} \]That makes 6 more faults, so there are 10 in all out of 12 references. The options are counts (8, 9, 10, 12), so the answer is 10. With three frames the same trace gives 9 faults, which is what 9 comes from, and 12 would mean every reference faults.

11.

Page Fault occurs when

A.Page is not in RAM
B.Page is in RAM
C.Page is locked
D.Page is swapped out manually

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: A

A page fault occurs when the page is not in RAM.

In virtual memory, a program's pages may be in main memory or on disk. When the CPU references a page whose page-table entry is marked invalid (not present), the hardware raises a page fault. The OS then finds the page on disk, loads it into a free frame (evicting another page if needed), updates the page table and restarts the instruction.

If the page is in RAM, the access proceeds normally with no fault. A locked page is pinned in memory precisely so that it never faults. Pages are not swapped out 'manually' by programs; and it is the later access to a page that has been moved out that causes the fault, not the moving itself.

Discuss in Forum

12.

Which of the following is a technique used in virtual memory management ?

A.Paging
B.Scheduling
C.Fragmentation
D.Time-sharing

Exam Year(s)

Tripura Public Service Commission - 2025,

Answer: A

A technique used in virtual memory management is Paging.

Paging divides a process's logical memory into fixed-size pages and physical memory into frames of the same size, so pages can be loaded on demand and placed anywhere. This lets a program larger than physical memory run.

Scheduling decides which process runs on the CPU, fragmentation is a problem of memory allocation rather than a technique, and time-sharing is a way of sharing the CPU among users.

Discuss in Forum

13.

What is thrashing in virtual memory systems ?

A.Excessive disk I/O operations
B.Excessive page faults
C.CPU overutilization
D.Memory fragmentation

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: B

Thrashing is excessive page faults.

When the processes running do not have enough frames for their working sets, nearly every memory reference causes a page fault. The system spends most of its time swapping pages in and out and very little doing useful work, so CPU utilisation collapses. Raising the degree of multiprogramming then makes it worse.

Heavy disk I/O is a symptom of thrashing, not its definition, and the CPU is under-used during thrashing rather than over-used. Memory fragmentation is a separate problem of unusable gaps in memory.

Discuss in Forum

14.

In the Least Recently Used (LRU) page replacement algorithm, which page is selected for replacement ?

A.The page that will not be used for the longest time
B.The page that has been in memory for the longest time
C.The page that was least recently accessed
D.The page with the lowest priority

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: C

LRU replaces the page that was least recently accessed.

LRU assumes that a page not used for a long time is unlikely to be used soon, using the recent past to predict the near future. On a page fault it evicts the page whose last use is furthest in the past, tracked with counters or a stack of page numbers.

Replacing the page that will not be used for the longest time is the optimal (OPT or Belady) algorithm, which needs knowledge of the future. Replacing the page that has been in memory longest is FIFO. Priority-based replacement is not LRU.

Discuss in Forum

15.

Suppose the time to service a page fault is on average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in an average memory access time of

A.1.9999 milliseconds
B.1 millisecond
C.9.999 microseconds
D.1.9999 microseconds

Exam Year(s)

Tripura Public Service Commission - 2025,

Answer: D

The average access time is 1.9999 microseconds.

Weight each case by its probability, working in microseconds (10 ms = 10,000 µs):

\[ \begin{aligned} t &= 0.9999 \times 1 + 0.0001 \times 10000 \\ &= 0.9999 + 1 = 1.9999\ \mu\text{s} \end{aligned} \]

The milliseconds options mix up the units by a factor of 1000. 9.999 microseconds would follow from a 99.9% hit ratio, ten times as many faults.

Discuss in Forum

16.

What is the number of page hits in LRU (Least Recently Used) page replacement policy in a system with 3 page frames and 8 pages with the reference string 0172327103 ? Assume 3 frames are initially empty.

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: A

There are 2 page hits.

Trace the string 0 1 7 2 3 2 7 1 0 3 with three frames, replacing the least recently used page on each miss.

Ref	Frames	Result
0, 1, 7	0 1 7	3 misses
2	2 1 7 (0 out)	miss
3	2 3 7 (1 out)	miss
2	2 3 7	hit
7	2 3 7	hit
1	2 1 7 (3 out)	miss
0	0 1 7 (2 out)	miss
3	0 1 3 (7 out)	miss

Only the references to 2 and 7 in the middle find their page already loaded, so there are 2 hits and 8 faults. Evicting by arrival order (FIFO) instead of last use would give 3 hits, the usual trap; 4 and 5 match no replacement rule here.

Discuss in Forum

17.

Consider the following page trace : 4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m = 4 will be

A.8
B.9
C.10
D.12

Exam Year(s)

UGC NET - 2012,

Answer: C

The page faults are 10.

FIFO with four frames, trace 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. The first four references 4, 3, 2, 1 load the empty frames, which makes 4 faults. The next 4 and 3 are hits.

\[ 5 \to \text{fault (evict 4)} \]

\[ 4 \to \text{fault (evict 3)} \]

\[ 3 \to \text{fault (evict 2)} \]

\[ 2 \to \text{fault (evict 1)} \]

\[ 1 \to \text{fault (evict 5)} \]

\[ 5 \to \text{fault (evict 4)} \]

That makes 6 more faults, so there are 10 in all out of 12 references. The options are counts (8, 9, 10, 12), so the answer is 10. With three frames the same trace gives 9 faults, which is what 9 comes from, and 12 would mean every reference faults.

Discuss in Forum

18.

If an instruction takes 'i' microseconds and a page fault takes an additional 'j' microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

A.i + j/k
B.i + j * k
C.(i + j)/k
D.(i + j) * k

Exam Year(s)

UGC NET - 2012,

Answer: A

An instruction takes i microseconds, and a page fault, which happens once in every k instructions on average, adds j microseconds. So over k instructions the total time is k times i plus one extra j, and dividing by k gives the average time for one instruction:

\[ T = \frac{k i + j}{k} = i + \frac{j}{k} \]

So the effective instruction time is i + j/k, option (A). Multiplying j by k, or dividing the sum of i and j by k, would not give the average time per instruction.

Discuss in Forum

19.

Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every \(10^{6}\) memory accesses, what is the effective access time for memory ?

A.21 ns
B.23 ns
C.30 ns
D.35 ns

Exam Year(s)

UGC NET - 2013,

Answer: C

The effective access time is the memory access time plus the average fault penalty: with one page fault in every 10^6 accesses the fault rate is p = 10^-6. The fault service time is 10 ms = 10,000,000 ns, so the penalty per access is 10^-6 x 10,000,000 ns = 10 ns. EAT = (1 - p) x 20 + p x 10,000,000 = about 20 + 10 = 30 ns, option (C). Values of 21 ns and 23 ns would need a much smaller page fault penalty than the 10 ns that is the case here, and 35 ns would need a rate of 1.5 faults in 10^6 accesses.

Discuss in Forum

20.

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order : ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are

A.9 and 7
B.7 and 6
C.9 and 8
D.8 and 6

Exam Year(s)

UGC NET - 2013,

Answer: C

With two frames and the reference string ABACABDBACD, FIFO gives 9 page interrupts and LRU gives 8, which is option (C).

FIFO: A, B, C, A, B, D, A, C and D each cause a page to be brought in, while the second A and the second B in the string hit. That makes 9.

LRU: the faults are A, B, C, B, D, A, C and D, since the second A, the third A and the second B find the page in memory. That makes 8.

Options (A) and (B) give too few faults for FIFO and (D) too few for FIFO and too many for LRU.

Discuss in Forum

Loading…

Topics

Other Subjects

Tags: Virtual Memory and Page Replacement Questions and Answers || Virtual Memory and Page Replacement MCQ Questions and Answers || Virtual Memory and Page Replacement GK Questions and Answers || Virtual Memory and Page Replacement GK MCQ Questions || Virtual Memory and Page Replacement Multiple Choice Questions and Answers || Virtual Memory and Page Replacement GK || GK on Virtual Memory and Page Replacement || Operating Systems Questions and Answers || Operating Systems MCQ Questions and Answers || Operating Systems GK Questions and Answers || GK on Operating Systems

Virtual Memory and Page Replacement Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications