<Li> The starting track number for the examples will be 35 . </Li> <Li> The list will need to be sorted in ascending order: 10, 20, 50, 75, 100 . </Li> <P> Both SCAN and C - SCAN behave in the same manner until they reach the last track queued . For the sake of this example let us assume that the SCAN algorithm is currently going from a lower track number to a higher track number (like the C - SCAN is doing). For both methods, one takes the difference in magnitude (i.e. absolute value) between the next track request and the current track . </P> <Ul> <Li> Seek 1: 50 − 35 = 15 </Li> <Li> Seek 2: 75 − 50 = 25 </Li> <Li> Seek 3: 100 − 75 = 25 </Li> </Ul>

Using a numerical example explain how elevator algorithm minimizes disk arm movement