At t=0 , a runner is moving forward at a speed of 7 m/s for 2 s the runner accelerates to the left at 0.5 m/s2 and backward at 1 m/s2 . find the runners final velocity in terms of the company directions (forward/back and left/right). what is the runners speed at t=2 (the length of the resultant of the perpendicular velocity components)? what is the runners position at t=2?

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.