Yes it is D like the other person said
Answer:
"Recoverability" is the appropriate solution.
Explanation:
- The above refers to either the DBMS work timetables where only certain processes are conducted out only when all transactions where such modifications are learned by the submission are implemented or operated.
- This technique is used to reinstate make informed even without system failures.
Answer:
Time taken to travel from one track to the next = 0.08ms
Initial track= 15 0
4 (15-4)*(0.08)= 0.88
40 (40-4)*(0.08)= 2.88
35 (40-35)*(0.08)= 0.4
11 (35-11)*(0.08)= 1.92
14 (14-11)*(0.08)= 0.24
7 (14-7)*(0.08)= 0.56
----------------------------------------------
Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms
Explanation:
We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.
Not to be rude, but this is elementary school. How would anyone know this?
