You are asked to calculate an object's velocity, in order to do so you must know the object's direction and speed. distance and time. speed and distance. direction and distance.

Arunner is jogging at a steady 3.6 km/hr. when the runner is 2.9 km from the finish line, a bird begins flying from the runner to the finish line at 14.4 km/hr (4 times as fast as the runner). when the bird reaches the finish line, it turns around and flies back to the runner. even though the bird is a dodo, we will assume that it occupies only one point in space, i.e., a zero-length bird. how far does the bird travel? (b) after this first encounter, the bird then turns around and flies from the runner back to the finish line, turns around again and flies back to the runner. the bird repeats the back and forth trips until the runner reaches the finish line. how far does the bird travel from the beginning? (i.e. include the distance traveled to the first encounter)

Consider a uniformly charged ring in the xy plane, centered at the origin. the ring has radius a and positive charge qdistributed evenly along its circumference. a)what is the direction of the electric field at any point on the z axis? . b)what is the magnitude of the electric field along the positive z axis? use k in your answer, where k=14πϵ0. d)the ball will oscillate along the z axis between z=d and z=−d in simple harmonic motion. what will be the angular frequency ω of these oscillations? use the approximation d≪a to simplify your calculation; that is, assume that d2+a2≈a2. express your answer in terms of given charges, dimensions, and constants

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.