Answer:
2
Explanation:
The second option is the only one that will work. The last would work but doesn't make the code any shorter.
Answer:
Sorted array will be:-
3 5 5 9
Explanation:
In Selection Sort algorithm it sorts the array by repeatedly finds the minimum in the array form the array that is unsorted and swaps it with the value at the first position.
The unsorted array:- 5 3 9 5
In first iteration
minimum is 3.
3 will be swapped with 5.
Now the array is 3 5 9 5
sorted array 3
In second iteration
unsorted array is 5 9 5
sorted array 3 5
and the minimum from it is 5
No swapping will occur.
In third iteration
unsorted array is 9 5
minimum is 5
sorted array 3 5 5
swap it with 9.
Now the array is sorted.
3 5 5 9
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.
