A file system with a one-level directory structure is implemented on a disk with disk block size of $$4$$ K bytes. The disk is used as follows:

Disk-block $$0:$$ File Allocation Table, consisting of one $$8$$-bit entry per date block, representing the data block address of the next date block in the file:

Disk block $$1:$$ $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ Directory, with one $$32$$ bit entry per file:
Disk block $$2:$$ $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ Data block $$1;$$
Disk block $$3:$$ $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ Data block $$2;$$ etc.

(a) What is the maximum possible number of files?
(b) What is the maximum possible file size in blocks?

The head of a moving head disk with $$100$$ tracks numbered $$0$$ to $$99$$ is currently serving a request at tract $$55.$$ If the queue of requests kept in $$FIFO$$ order is $$10, 70, 75, 23, 65$$ Which of the two disk scheduling algorithms $$FCFS$$ (First Come First Served) and $$SSTF$$ (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.

If the overhead for formatting a disk is $$96$$ bytes for $$40000$$ bytes sector, Compute the unformatted capacity of the disk of the following parameters:
Number of surface: $$8$$
Outer diameter of the disk : $$12cm$$
Inner diameter of the disk: $$4cm$$
Inter track space: $$0.1mm$$
Number of sectors per track: $$20$$

Assuming the current disk cylinder to be $$50$$ and the sequence for the cylinders to be
$$1, 36, 49, 65, 53, 1, 2, 3, 20, 55, 16, 65$$ and $$78$$ find the sequences of servicing using
(i) shortest-seek time first $$(SSTF)$$
(ii) elevator disk scheduling polices.