The document discusses different disk scheduling algorithms used to manage requests to access data from a disk drive. It describes First Come First Serve (FCFS) which processes requests in the order they arrive, Shortest Seek Time First (SSTF) which selects the request with the shortest seek time from the current head position, SCAN which moves the disk arm in one direction serving all requests until the end and then reverses direction, and C-SCAN which is similar to SCAN but does not serve any requests when returning to the opposite end of the disk after reversing direction.

1. DISKSCHEDULINGALGORITHM
2023EV083
ASSIGNMENT SERIES - 71

2. DISKSCHEDULING
• As we realize that on a solitary PC we can Perform Numerous Tasks all at once so the
executives are likewise fundamental on every one of the Running Cycles that are
running on the framework at a time.
• With the assistance or Coming of the Multiprogramming we can Execute Many
Projects all at once.
• So for Controlling and giving the Memory to every one of the Cycles Working
Framework utilizes the Idea of Plate Booking.

3. TYPESOF DISKSCHEDULING

4. FCFSALGORITHM
• It means 'the early bird gets the worm'. As the name recommends, the
solicitation which starts things out will be handled first, etc.
• The solicitations coming to the plate are organized in a legitimate succession as
they show up.
• Since each solicitation is handled in this calculation, there is zero chance of
'starvation'.

5. SSTFALGORITHM
• SSTF is a shortened form of Most brief Look for Time First (SSTF) which is a
circle booking calculation.
• This is finished by choosing the solicitation which has the least look for time
from the ongoing head position.
• This calculation has less 'look for time' when contrasted with FCFS Calculation.

6. SCANALGORITHM
• It is additionally called Lift Calculation.
• In this calculation, the circle arm moves into a specific heading till the end,
fulfilling every one of the solicitations coming in its path, and then it turns back
and moves in the converse course fulfilling demands coming in its way.
• After that, it reverses its direction and starts to scan again the requests in its
path and serves them.

7. C - SCANALGORITHM
• It means "Roundabout Output".
• This calculation is practically equivalent to the Output plate calculation however
one thing that makes it different is that 'in the wake of arriving at the one end
and turning around the head course, it begins to return.
• Subsequent to arriving at the finish of the plate it inverts its course and again
begins to move to the opposite finish of the circle yet while returning it serves
no solicitations.

8. THE END