A disk pack contains several magnetic disks connected to a rotating spindle

Unspanned: record can span two blocks

In ordered Files Record Insertion is quite efficient

In linear hashing the directory is a binary tree

Linear hashing does require an overflow area but does not use a directory

A dense index has index entries for only some of the search values

primary index is dense index

In a B+tree, all pointers to data records exists at the leaf-level nodes

Reading or writing a disk block is time consuming because of the seek time

Collisions occur when a new record hashes to a bucket that is already fuill

uses mirrored disks

the program checks the subsequent positions in order until an unused (empty) position is found,

If record size R=2 kbytes

block size B=4096 bytes r=12288 records, The number of file blocks is

Preferred secondary storage device for low storage capacity and high cost.

Data stored as magnetized areas on magnetic disk surfaces

Data stored contains several magnetic disks connected to a rotating spindle.

Disks are divided into concentric circular tracks on each disk surface.

Track capacities vary typically from 4 to 50 bytes or more

A sectors is divided into smaller blocks or track