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.
Answer:
When Scheme is a pure functional language, it cannot include the function DISPLAY. Since the pure functional languages will return the same value whenever the same expression is evaluated, and the DISPLAY would be the output and thus it cannot be part of the purely functional language. Thus in the pure functional language we can evaluate the expressions with the same arguments and it returns the same value since there is no state to change.
Explanation:
It depends on the <span>mapping techniques. Do you have a particular one in mind. The options are associative mapping, direct mapping and set associative mapping.</span>