Computer Science · Page Replacement Algorithms
Match the page replacement algorithms in LIST-I with their defining characteristics or mechanisms in LIST-II: LIST-I (Algorithm) A. FIFO B. Optimal (OPT) C. Least Recently Used (LRU) D. Second Chance LIST-II (Trait/Mechanism) I. Theoretical benchmark that minimizes faults using future knowledge. II. FIFO refinement utilizing a reference bit and a circular clock hand. III. Simplest implementation using a queue to replace the oldest page. IV. Replaces pages by analyzing past behavior using a stack or counters. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-I, B-III, C-II, D-IV
- 2A-III, B-IV, C-I, D-II
- 3A-III, B-I, C-IV, D-II✓
- 4A-IV, B-I, C-II, D-III
Correct answer
A-III, B-I, C-IV, D-II
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Page Replacement Algorithms MCQs →Want more practice questions on Page Replacement Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Page Replacement Algorithms