NEW
Font size
WorksheetsOS Algorithm
Total questions: 13
Worksheet time: 11mins
Which of the following is a disadvantage of Round Robin Scheduling Algorithm?
It provides efficient utilization of CPU time.
It can cause inefficient handling of I/O bound processes
It may result in poor response time for interactive applications
It leads to high turnaround time for processes
3. In Least Recently Used Page Replacement, which page is replaced?
A random page
The largest page
The most recently used page
The least recently used page
4. What is the main advantage of Least Recently Used Page Replacement?
Maximizes page faults
Has no impact on page faults
Causes system crashes
Minimizes page faults
5. What is the main goal of Shortest Seek Time First Algorithm?
Minimize seek time of the disk
Maximize efficiency of the disk
Minimize processing time of the disk
Maximize seek time of the disk
6. Which of the following is a drawback of Shortest Seek Time First Algorithm?
May lead to starvation of some requests
Improves disk access time
Reduces the number of seek operations
Increases the overall system throughput
7. In FIFO Page Replacement Algorithm, which page is replaced?
The largest page
The newest page
The oldest page
The most frequently accessed page
8. What is the main advantage of FIFO Page Replacement Algorithm?
No impact on system performance
Maximal overhead
Minimal overhead
Randomly selects pages to replace
What is the primary benefit of using the First-In-First-Out (FIFO) Page Replacement Algorithm?
Maximizes system performance
Minimizes overhead
Randomly selects pages to replace
Minimizes page faults
12. In Shortest Seek Time First (SSTF) Disk Scheduling Algorithm, what is the main goal?
Maximize seek time of the disk
Minimize seek time of the disk
Maximize efficiency of the disk
Minimize processing time of the disk
13. What is the main advantage of Round Robin Scheduling Algorithm?
It provides efficient utilization of CPU time.
It can cause inefficient handling of I/O bound processes
It may result in poor response time for interactive applications
It leads to high turnaround time for processes
Consider a memory system with 4 page frames and the following reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1. Using the optimal page replacement algorithm, how many page faults will occur?
6
7
8
9
Consider a CPU scheduling with a time quantum of 4 units. Process P1 arrives at time 0 and needs 8 units of time, process P2 arrives at time 1 and needs 4 units of time, and process P3 arrives at time 2 and needs 2 units of time. What is the average waiting time for these processes?
9.67 units
4 units
5 units
6 units
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. The disk head is initially at cylinder 53 moving towards larger cylinder numbers. Using the C-LOOK scheduling algorithm, what is the total seek time required to satisfy all the requests?
382
299
331
322
