Scribd
Upload
119 views

File Hash Examples

The document describes the characteristics of a disk drive including block size, interblock gap size, number of blocks per track, number of tracks per surface, and number of disks in the disk pack. It then poses several questions about calculating capacities, number of cylinders, transfer rates, seek times, and storing a student record file on the disk.

Uploaded by

Quang Thiện Chu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
119 views

File Hash Examples

The document describes the characteristics of a disk drive including block size, interblock gap size, number of blocks per track, number of tracks per surface, and number of disks in the disk pack. It then poses several questions about calculating capacities, number of cylinders, transfer rates, seek times, and storing a student record file on the disk.

Uploaded by

Quang Thiện Chu
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block

size B=512 bytes, interblock gap size G=128 y g p bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
What is the total capacity of a track and what is its useful capacity (excluding interblock gaps)?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size y g p B=512 bytes, interblock gap size G=128 bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
How many cylinders are there?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size B=512 bytes, interblock gap size G=128 y g p bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
What is the total capacity and the useful capacity of a cylinder?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size y g p B=512 bytes, interblock gap size G=128 bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
What is the total capacity and the useful capacity of a disk pack?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size B=512 bytes, interblock gap size G=128 bytes, number of blocks per track=20 number of track=20, tracks per surface=400. A disk pack consists of 15 double-sided disks.
Suppose the disk drive rotates the disk pack at a speed of 2400 rpm ( p p (revolutions p minute); what is per ) the transfer rate tr (total track size in bytes)/(time for one disk revolution in msec ) in bytes/msec and the block transfer time btt in msec? What is the average rotational delay rd in msec?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size y g p B=512 bytes, interblock gap size G=128 bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
Suppose the average seek time is 30 msec msec. How much time does it take (on the average) in msec to locate and transfer a single block given its block address?

Consider a disk with the following characteristics (these are not parameters of any particular disk unit): block size B=512 bytes, interblock gap size G=128 y g p bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double-sided disks.
Calculate the average time it would take to transfer 20 random blocks.

A file has r=20000 STUDENT records of fixedlength. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), bytes) SEX (1 byte) MAJORDEPTCODE (4 byte), bytes), MINORDEPTCODE (4 bytes), CLASSCODE (4 bytes, integer), and DEGREEPROGRAM (3 bytes). An additional byte is used as a deletion marker. The file is stored on the disk whose parameters are given p g in part 1.
Calculate the record size R in bytes.

A file has r=20000 STUDENT records of fixedlength. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), MAJORDEPTCODE (4 bytes), MINORDEPTCODE (4 bytes), CLASSCODE (4 bytes, integer), and DEGREEPROGRAM (3 bytes). An additional byte is used as a deletion marker. The file is stored on the disk whose parameters are given in part 1.
Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization

A file has r=20000 STUDENT records of fixedlength. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), MAJORDEPTCODE (4 bytes), MINORDEPTCODE (4 bytes), CLASSCODE (4 bytes, integer), and DEGREEPROGRAM (3 bytes). An additional byte is used as a deletion marker. The file is stored on the disk whose parameters are given in part 1.
Calculate the average time it takes to find a record by doing a linear search on the file

1) A PARTS file with Part# as hash key includes records with the following Part# values: 2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750, 1074 7115 1620 2428 3943 4750 6975, 4981, 9208. Load the records into expandable hash files based on extendible hashing. Show the structure of the directory at each step. Sh t Show th di t the directory at each step, t h t and the global and local depths. Use the has function h(k) = K mod 128

You might also like