subject

assume that a disk has 50 cylinders with an initial request on cylinder 7.the disk receives new request for cylinder 1 30 12 26 4 and 6 respectively. graphically represent this scenario using each of the following disk scheduling algorithm; shortest seek first, first come first serve and scan assuming the head moves towards 0​

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 23.06.2019 03:00
State 7 common key's for every keyboard
Answers: 1
question
Computers and Technology, 24.06.2019 03:00
What is one potential problem associated with an organization purchasing new technology early in its lifecycle
Answers: 1
question
Computers and Technology, 24.06.2019 15:00
Universal windows platform is designed for which windows 10 version?
Answers: 1
question
Computers and Technology, 24.06.2019 15:30
What is the function of compilers and interpreters? how does a compiler differ from an interpreter?
Answers: 2
You know the right answer?
assume that a disk has 50 cylinders with an initial request on cylinder 7.the disk receives new requ...
Questions
question
Mathematics, 28.07.2019 21:30
Questions on the website: 13722367