Question $1$: 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 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$)?$

How many cylinders are there?

What are the total capacity and the useful capacity of a

cylinder?

$-$What are the total capacity and the useful capacity of a

disk pack?

Question $2$:$\_$PARTS file with Part# as the hash key $($K$)$

includes records with the following Part# values: $2360,3760,$

$3232,4692,4871,5659,1821,1074,7115,1620,2428,3943,$

$4750,6975,4981,1111,4123,8211,7654,$ and $9208.$ The

hash file has $20$ cells $,$ numbered $0$ to $19.$ Each cell holds one

record.

a$)$ Rewrite the following hash function to produce the

required hash values: $h(K)=$Kmodx.

b$)$ Using Chained with Separate Overflow area method,

load these records into the hash file in the given order by

showing the hash file with all the entries.

c$)$ Calculate the average search length for searching all

entries.

d$)$ Compare the average search length of this method with

that of the Progressive Overflow.

Question $3$: Consider a disk with block size B $=512$ bytes. A

block pointer is $P=6$ bytes long, and a record pointer is $PR=$

$7$ bytes long. A file has $r=30,000$ EMPLOYEE records of

fixed length. Each record has the following fields: Name $(30$

bytes$),$Ssn $(9$ bytes$),$ Department$\_$code $(9$ bytes$),$ Address $(40$

bytes$),$ Phone $(10$ bytes$),$ Birth$\_$date $(8$ bytes$),$ Sex $(1$ byte$),$

Job$\_$code $(4$ bytes$),$ and Salary $(4$ bytes, real number$).$ An

additional byte is used as a deletion marker.

Calculate the record size $R$ in bytes.

Calculate the blocking factor bfr and the number of file

blocks b$,$ assuming an unspanned organization.

Suppose that the file is ordered by the key field Ssn and

we want to construct a primary index on Ssn$.$ Calculate

$($i$)$ the index blocking factor bfri $($which is also the index

fan$-$out fo$)$; $($ii$)$ the number of first$-$level index entries

and the number of first$-$level index blocks; $($iii$)$ the

number of levels needed if we make it into a multilevel

index; $($iv$)$ the total number of blocks required by the

multilevel index; and $($v$)$ the number of block accesses

needed to search for and retrieve a record from the file$-$

given its Ssn value$-$using the primary index.