To Implement Disk Scheduling Algorithms

Post Test

1. Which disk scheduling algorithm tends to have the lowest average seek time?

a) FCFS
b) SSTF
c) SCAN
d) C-SCAN

2. Which algorithm is best suited for handling a high volume of requests scattered across the disk?

a) FCFS
b) SSTF
c) SCAN
d) C-SCAN

3. What is the main difference between SCAN and C-SCAN algorithms?

a) SCAN serves requests in both directions, while C-SCAN only serves in one direction.
b) SCAN prioritizes the shortest seek time, while C-SCAN prioritizes the closest cylinder.
c) SCAN is more efficient for random requests, while C-SCAN is better for sequential requests.
d) SCAN is used for read operations, while C-SCAN is used for write operations.

4. Which of the following factors can affect the performance of disk scheduling algorithms?

a) Disk speed
b) Number of requests
c) Distribution of requests
d) All of the above

5. What is a major concern with SSTF (Shortest Seek Time First) algorithm?

a) It can lead to starvation of requests far from the current head position.
b) It is highly complex and resource-intensive.
c) It does not consider the order of requests.
d) It is not efficient for handling random requests.