Suppose the average seek time of a disk access is 6 ms, the overhead to move the r/w head is 1 ms, and that it takes 1 ms to move over every 4000 cylinders. Which of the following is CORRECT about the number of cylinders in this disk?

Consider a disk with 10,000 cylinders, where each track can store 10 blocks, gaps occupy 10% of the track, average seek time is 6 ms, and average rotational delay is 4 ms. Which of the following best estimates the average time to read 2 tracks on the same cylinder?

Suppose a hard disk manufacturer guarantees that their disks will NEVER crash. If we use those disks, then we do not need to make backups of the disks.   

Consider a disk with 10,000 cylinders, a track can hold 10 blocks, gaps occupy 10% of the track, average seek time is 6 ms, and average rotational delay is 4 ms. Which of the following best estimates the average time to read 5 consective blocks from a track?  

If the average rotational delay of a disk is 4 ms, what is the rotational speed of the disk in terms of rounds per minute (RPM)?

We want to use the Two-Phase, Multiway, Merge-Sort method to sort ANY table that does NOT fit into the available M main memory blocks. Suppose the number of steps required in phase 2 to complete the sort process does NOT matter. What would be the minimum M required?  The answer is simply an integer, like 52.  

Suppose the available main memory is M blocks, and block size is B bytes. Suppose using the two phase, multiway, merge-sort (TPMMS) method, we sort relation R that is stored in N disk blocks such that phase 2 completes in 1 step. If R is increased to 2N blocks and we still want phase 2 to complete in 1 step, which answer best estimates M' (the required number of main memory blocks)?  

Consider a HD that rotates at 8000 RPM. If block transfer time (btt) is 1 ms, which of the following answers best estimates the time to read 2 random blocks from the same track, if the r/w head is currently on that track?    

Suppose a relation R is stored in 6521 disk blocks. Also suppose the available main memory M is 22 blocks. We want to sort R using the two phase, multiway, merge-sort (TPMMS) method discussed in class. How many runs (sorted sub-lists) will be created in Phase 1?

We want to sort table T which is stored in 13,224 disk blocks, using the two phase, multiway, merge-sort (TPMMS) method. Assume phase 2 completes in 1 step. What is the minimum number of main memory blocks required?