Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 39
Q1061:
Which of the following algorithms is used mainly for comparison purposes due to its difficulty in implementation?
A. FIFO
B. Optimal
C. LRU
D. None of the above
Correct Answer:
B
Chapter: 40
Q1062:
What is Belady's Anomaly in page replacement algorithms?
A. Page fault rate decreases with more frames
B. Page fault rate increases with more frames
C. Frames allocated do not affect page faults
D. None of the above
Correct Answer:
B
Chapter: 40
Q1063:
Which page replacement algorithm does not suffer from Belady’s Anomaly?
A. FIFO
B. LRU
C. LFU
D. MFU
Correct Answer:
B
Chapter: 40
Q1064:
Belady’s Anomaly occurs when the page fault rate _______ as the number of allocated frames increases.
A. Decreases
B. Increases
C. Remains the same
D. Is undefined
Correct Answer:
B
Chapter: 40
Q1065:
The Least Frequently Used (LFU) algorithm selects the page with the _______ reference count.
A. Largest
B. Smallest
C. Average
D. Most recent
Correct Answer:
B
Chapter: 40
Q1066:
In Least Frequently Used (LFU), pages that have been used heavily during the initial phase of a process _______.
A. Remain in memory
B. Are discarded immediately
C. Are given priority
D. Are never replaced
Correct Answer:
A
Chapter: 40
Q1067:
The Most Frequently Used (MFU) algorithm selects the page with the _______ reference count.
A. Largest
B. Smallest
C. Recent
D. None of the above
Correct Answer:
A
Chapter: 40
Q1068:
The LRU Approximation algorithm uses a _______ bit to track page references.
A. Reference
B. Fault
C. Access
D. Modified
Correct Answer:
A
Chapter: 40
Q1069:
A page replacement algorithm that uses a reference bit to track page usage is called the _______ algorithm.
A. FIFO
B. LRU
C. LFU
D. MFU
Correct Answer:
B
Chapter: 40
Q1070:
Page Buffering Algorithm helps to _______ by keeping a pool of free frames.
A. Increase memory usage
B. Reduce page faults
C. Decrease CPU usage
D. Reduce I/O operations
Correct Answer:
B
Chapter: 40
Q1071:
In the global replacement scheme, pages are selected from _______ frames.
A. Only one process
B. All available frames
C. Higher priority processes
D. Lower priority processes
Correct Answer:
B
Chapter: 40
Q1072:
The _______ allocation scheme divides free frames equally among processes.
A. Fixed
B. Proportional
C. Priority
D. Dynamic
Correct Answer:
A
Chapter: 40
Q1073:
In _______ allocation, the number of frames allocated is proportional to the size of the process.
A. Fixed
B. Proportional
C. Priority
D. Dynamic
Correct Answer:
B
Chapter: 40
Q1074:
If a process does not have enough pages, it may experience _______ due to a high page-fault rate.
A. Thrashing
B. Buffering
C. Fragmentation
D. LRU
Correct Answer:
A
Chapter: 40
Q1075:
Thrashing results in _______ CPU utilization.
A. Increased
B. Decreased
C. Constant
D. Fluctuating
Correct Answer:
B
Chapter: 40
Q1076:
A system in thrashing spends more time _______ than executing.
A. Paging
B. Processing data
C. Accessing memory
D. Executing instructions
Correct Answer:
A
Chapter: 40
Q1077:
If thrashing occurs, the operating system should _______ the degree of multiprogramming.
A. Increase
B. Decrease
C. Keep constant
D. Randomize
Correct Answer:
B
Chapter: 40
Q1078:
Thrashing can be limited by using a _______ replacement scheme.
A. Global
B. Local
C. Proportional
D. Fixed
Correct Answer:
B
Chapter: 40
Q1079:
The allocation scheme where high-priority processes can steal frames from low-priority processes is called _______ allocation.
A. Fixed
B. Proportional
C. Priority
D. Dynamic
Correct Answer:
C
Chapter: 40
Q1080:
If a process starts thrashing, it _______ frames from other processes.
A. Steals
B. Allocates
C. Requests
D. Does not affect
Correct Answer:
A