Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a…

PYQ GATE 2012

Consider the virtual page reference string

1, 2, 3, 2, 4, 1, 3, 2, 4, 1

on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

  1. A.

    OPTIMAL < LRU < FIFO

  2. B.

    OPTIMAL < FIFO < LRU

  3. C.

    OPTIMAL = LRU

  4. D.

    OPTIMAL = FIFO

Attempted by 136 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…