358 views
1 votes
1 votes

please explain the approach.

1 Answer

Best answer
2 votes
2 votes
There are $3$ files to be stored on a tape so total permuation = $3! = \ 6$

$1) \ 3\rightarrow 5\rightarrow 10$  Access time = $3 \ + \ 8 + 18   \ \ = 29 $

$2) \ 3\rightarrow 10\rightarrow 5$  Access time = $3 \ + \ 13 + 18 = 34 $

$3) \ 5\rightarrow 3\rightarrow 10$  Access time = $5 \ + \ 8 + 18 = 31 $

$4) \ 5\rightarrow 10\rightarrow 3$  Access time = $5 \ + \ 15 + 18 = 38 $

$5) \ 10\rightarrow 3\rightarrow 5$  Access time = $10 \ + \ 13 + 18 = 41 $

$6) \ 10\rightarrow 5\rightarrow 3$  Access time = $10 \ + \ 15 + 18 = 43 $

 Minimum$\{ 29,34,31,38,41,43\} = 29$
selected by

Related questions

1 votes
1 votes
3 answers
2
Angkit asked Apr 23, 2017
14,421 views
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
0 votes
0 votes
1 answer
3
1 votes
1 votes
2 answers
4
Ankit Sahu asked Feb 4, 2019
1,112 views
Why the value of D is 80 in concurrent process question and not 0? The question didn't mention that each statement take 3 instruction to execute so why assume that?