Assignment-5

Note: Attempt all questions and give the logical answer in a precise manner.

Q1. Some systems provide file sharing by maintaining a single copy of a file; other systems maintain
several copies, one for each of the users sharing the file. Discuss the relative merits of each
approach.

Q2. Some systems automatically open a file when it is referenced for the first time and close the file
when the job terminates. Discuss the advantages and disadvantages of this scheme compared with
the more traditional one, where the user has to open and close the file explicitly.

Q3. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving
a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending
requests, in FIFO order, is: 86,1470,913,1774,948,1509,1022,1750,130 Starting from the current
head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the
pending requests for each of the following disk-scheduling algorithms?

a. FCFS

b. SSTF

c. SCAN

d. C-SCAN

e. LOOK

f. C-LOOK

Q4. Explain the term RAID and its characteristics. Also, explain various RAID levels with their
advantages and disadvantages.

Q5. Explain the concept of file system management. Also, explain various file allocation and file
access mechanisms in details.

Q6. Explain tree level directory structure.

Q7. Define Seek time and Latency time.

Q8. Write short notes on the following

i) File system protection and security

ii) Linked File allocation methods

Q9. Discuss the Linked, Contiguous, Index and multilevel Indexing file allocation schemes. Which
allocation scheme will minimize the amount of space required in directory structure and why?

Q10. Consider a disk having a seek time of 60 ns and rotational rate is 360 rpm. Each track of the disk
has 512 sectors and each sector is having of 2KB in size.
(i) What is the time required to read 4 successive sectors?

(ii) What is data transfer rate?