Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q1051: The number of page faults decreases when _________.
- A: The number of free frames increases
- B: The page table is modified
- C: The process is swapped out
- D: A page is replaced
View Answer
A
Q1052: LRU page replacement may require _________.
- A: Substantial hardware assistance
- B: Minimal memory
- C: No extra resources
- D: A larger time frame
View Answer
A
Q1053: In the stack-based implementation of the LRU algorithm, the _________ is always the most recently used page.
- A: Bottom of the stack
- B: Middle of the stack
- C: Top of the stack
- D: First page
View Answer
C
Q1054: In the counter-based implementation of LRU, the page that is replaced is the one with _________.
- A: The smallest time-of-use value
- B: The most recent time-of-use value
- C: The largest time-of-use value
- D: The most modified time-of-use value
View Answer
A
Q1055: The page replacement algorithm that suffers from Belady’s anomaly is _________.
- A: FIFO
- B: Optimal
- C: LRU
- D: None of the above
View Answer
A
Q1056: A page fault occurs when _________.
- A: The page is not found in the frame
- B: The page is being swapped out
- C: A new frame is needed
- D: The modify bit is not set
View Answer
A
Q1057: Which page replacement algorithm guarantees the lowest possible page-fault rate for a fixed number of frames?
- A: FIFO
- B: Optimal
- C: LRU
- D: None of the above
View Answer
B
Q1058: The FIFO algorithm uses a _________ to hold all pages in memory.
- A: Stack
- B: Queue
- C: Table
- D: List
View Answer
B
Q1059: In the LRU page replacement algorithm, the page that has not been used for the _________ period of time is replaced.
- A: Longest
- B: Shortest
- C: Most recent
- D: Last
View Answer
A
Q1060: In the FIFO page replacement algorithm, when a page is brought into memory, it is inserted at _________.
- A: The head of the queue
- B: The tail of the queue
- C: The front of the queue
- D: The middle of the queue
View Answer
B