Consider a file currently consisting of 200 blocks. assume that the file control block (and the index block in the case of indexed allocation) is already in memory. calculate how many disk i/o operations are required for contiguous, linked, and indexed (single-level) allocation strategies, for each of the conditions listed below. in the contiguous-allocation case, assume that there is not room to grow at the beginning but there is room to grow at the end. also assume that the block information to be added is stored in memory.

Is a  vector quantity  that refers to "the rate at which an object changes its position." imagine a person moving rapidly - one step forward and one step back - always returning to the original starting position. while this might result in a frenzy of activity, it would result in a zero velocity. because the person always returns to the original position, the motion would never result in a change in position. since velocity is defined as the rate at which the position changes, this motion results in zero velocity. if a person in motion wishes to maximize their velocity, then that person must make every effort to maximize the amount that they are displaced from their original position. every step must go into moving that person further from where he or she started. for certain, the person should never change directions and begin to return to the starting position.