Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Request number 1 2 3 4 5 6 7 Track Number 50 13 7 65 29 72 4 Determine the order

ID: 3631880 • Letter: R

Question

Request number 1 2 3 4 5 6 7
Track Number 50 13 7 65 29 72 4

Determine the order in which these requests will be serviced using each of the following disk scheduling algorithm.)Assume that the head is initially at track 35,and moving inwards)
First come first served( FIFO



C-SCAN


Can anyone help me in dia please?

Explanation / Answer

First come first served( FIFO 35 -> 50-> 13 ->7-> 65-> 29-> 72-> 4 { 35 is start track according to the problem C-SCAN 35->0->4->7->13->29->50->65->72 {in moving inwards the head can not scan any value in C-SCAN algorithm when reach last track the head directly return to 0 number track

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote