Q1.The r/w head of a disk is at track 143. The previous position was track 0. Requests to access the following tracks have arrived: 143, 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130

a) In which order will the tracks be visited using:

• FIFO
• SSTF
• Scan (going right)
• C-Scan (going right)

b)Starting from track 143, determine the number of tracks traversed by the r/w head under each algorithm to service all requests.

Q2. To encode 8-bit bytes, Hamming code requires 4 parity bits at positions 1, 2, 4, and 8.

The table shows which positions are covered by which parity bit.

1 2 3 4 5 6 7 8 9 10 11 12 p1 p2 d1 p4 d2 d3 d4 p8 d5 d6 d7 d8 p1 X X X X X X p2 X X X X X X p4 X X X X X p8 X X X X X