| Full Form |
First Come First Serve |
Shortest Seek Time First |
| Operation Principle |
Entertains tasks in the order they arrived in the disk queue |
Serves the request closest to the current position of the head |
| Complexity |
Simple and easy to understand |
More complex due to the consideration of seeking time and head movement |
| Movement Direction |
The head or pointer moves in the direction in which the tasks arrive |
The direction of the head pointer matters; it moves toward the closest task |
| Average Waiting Time |
Provides a higher average waiting time |
Generally results in lower average waiting time |
| Average Response Time |
Higher average response time |
Generally results in lower average response time |
| Fairness |
Fair policy of handling upcoming requests |
Efficient in terms of seek time, but may not be as fair in handling all requests |
| Efficiency |
Less efficient in terms of seek time |
More efficient in terms of seek time |
