Data Structures and Object-Oriented Development II - Homework 3: Secondary Storage - Prof., Assignments of Data Structures and Algorithms

Download Data Structures and Object-Oriented Development II - Homework 3: Secondary Storage - Prof. and more Assignments Data Structures and Algorithms in PDF only on Docsity! CS 2606 Data Structures & OO Devel II Homework 3: Secondary Storage Last modified: 2/20/2007 9:55:41 AM 1 You will submit your solution to this assignment to the Curator System (as HW3). Your solution must be either a plain text file (e.g., NotePad) or a MS Word document. 1. [10 points] Let T be a PR quadtree storing data points that lie in a square with side S. According to the survey paper by Samet, if D is the minimum distance between any two of the data points, the maximum number of levels in a PR quadtree is: ( )log 2 /S D   Give a proof of this claim. [Hint: consider what would maximize the height of the tree.] 2. [20 points] Assume a system uses a hard drive with the following physical characteristics: # of tracks per surface 8096 avg # of sectors per track 2048 sector size 0.5 KB cluster size 4 KB spindle speed 14400 RPM head start time 1 ms track to track seek time 0.02 ms In answering the following questions, express all final time values to the nearest hundredth of a millisecond (e.g., 8.33 ms). a) What is the average random head seek time for this drive? b) What is the average rotational latency for this drive? c) What is the average total time required to read one randomly-chosen cluster from this drive? d) What is the average total time required to read a file of 10 MB from this drive if the clusters that hold the file are allocated contiguously on adjacent tracks? 3. [20 points] Suppose that a buffer pool stores 5 blocks of data, and that at some point in program execution the pool contents are as shown below: LRU 0 1 2 3 4 MRU 227 71 109 371 111 Assuming the LRU replacement strategy is used, show the contents of the buffer pool after the following sequence of block references have been made: 227 371 230 371 109 110 111 112 371 110 112 111 371 109 371 State the number of faults that occurred while servicing the reference stream above. A fault occurs when a reference requires that a data block must be loaded from disk.