Describe shortest seek time first algorithm


Problem:

Question 1- Consider the following list of disk service requests, received in the following order: 49, 12, 59, 22, 58, 33, 80 Assume that the disk head is currently located at position/cylinder 50. List the order in which these requests will be processed using the shortest-seek-time-first algorithm. How far in all (in terms of cylinders) will the disk head move to service these requests?

Question 2- Assume 185 and 122 are signed 8-bit decimal integers stored in sign-magnitude format. Calculate 185-122. Is there overflow, underflow, or neither?

Step by step instructions so I can understand would be greatly appreciated!

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: Describe shortest seek time first algorithm
Reference No:- TGS0893775

Expected delivery within 24 Hours