Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q1081: In a system with thrashing, the average service time for a page fault _______.
- A: Increases
- B: Decreases
- C: Remains constant
- D: Is random
View Answer
A
Q1082: The _______ page replacement algorithm tries to keep the most recently used pages in memory.
- A: FIFO
- B: LRU
- C: LFU
- D: MFU
View Answer
B
Q1083: The term "local replacement" means that a process can only select replacement pages from its _______ frames.
- A: Own
- B: Shared
- C: Allocated
- D: None of the above
View Answer
A
Q1084: The concept of allocating a minimum number of frames to guarantee execution of an instruction is referred to as _______ allocation.
- A: Fixed
- B: Proportional
- C: Priority
- D: Dynamic
View Answer
A
Q1085: Thrashing occurs when the system is spending more time _______ than performing useful work.
- A: Swapping pages
- B: Running processes
- C: Handling input
- D: Fetching data
View Answer
A
Q1086: If the degree of multiprogramming is too high, it can lead to _______.
- A: Thrashing
- B: Buffering
- C: Fragmentation
- D: Deadlock
View Answer
A
Q1087: The algorithm that selects the least frequently used page for replacement is called _______.
- A: LRU
- B: MFU
- C: LFU
- D: FIFO
View Answer
C
Q1088: The MFU algorithm assumes that the page with the _______ reference count is the least likely to be needed.
- A: Smallest
- B: Largest
- C: Recent
- D: None of the above
View Answer
B
Q1089: The goal of the LRU approximation algorithm is to track pages that have been _______ recently.
- A: Used
- B: Removed
- C: Modified
- D: Written
View Answer
A
Q1090: To prevent thrashing, local replacement limits page replacement to the _______ of a process.
- A: Set
- B: Pool
- C: Frames
- D: Size
View Answer
C