TUTORIAL 5
Group 1:
     1. Explain indexed allocation method with an example. (5 marks)
     2. Explain the different directory structures used in file system.(10 marks)
Group 2:
     1. Different users may need different types of access to a file or directory.
           Explain
           the most general scheme to implement identity dependent access. (4
           marks)
     2. How many child process will be created for the following code ?
           void main()
           { fork(); fork(); printf("HELLO\n,,); fork();
           printf("WELCOME\n”); }
           How many times HELLO and WELCOME will be printed? Justify your answer.
           (6 marks)
     3. Which are the three methods used to pass parameters to operating system?.
           (3marks)
Group 3:
     1. List and explain the different access methods for files. (4 marks)
     2. Describe linked and indexed allocation methods for files with the help of
           neat
           diagrams. (10 marks)
Group 4:
     1. Describe the general scheme of using three classifications of users in
           connection
           with file access control with the help of an example. (5 marks)
     2. How many times will ‘Forked’ get printed by the below code and justify
           your
           answer.
           int main() {
           fork();
           fork();
           printf("Forked\n");
           return 0;} (3 marks)
Group 5:
     1. Define seek time, rotational latency and disk bandwidth of disks.+. (3
           marks)
     2. Explain FCFS, SSTF and SCAN disk scheduling algorithms, using the given
           disk queue of requests: 82,170,43,140,24,16,190. Find the total seek time for
           each case. Assume that, the disk has 200 cylinders ranging from 0 to 199 and
     3. the current position of head is at cylinder 50. (9 marks)
Group 6:
     1. Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and
           the current position of the head is at cylinder 100. For the given disk
           queue of requests: - 20,89, 130, 45, 120 and 180, draw the head
           movement in FCFS, SSTF, CSCAN disk scheduling algorithms and
           compute the total head movements (in cylinders) in each. (9 marks)
     2. Point out the significance of Zero capacity queue in IPC? (2 marks)
Group 7:
  1. Different users may need different types of access to a file or directory.
     Explain the most general scheme to implement identity dependent access. (4
     marks)
  2. Explain indexed allocation method with an example. (5 marks)
  3. Write notes on disk formatting. (3 marks)
  4. Explain two level directory structure with the help of a diagram. (3 marks)
Group 8:
     1. Compare sequential access and direct access methods of storage devices.
           (3 marks)
     2. Explain the different directory structures used in file system.(10 marks)
     3. Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and
           the current position of the cylinder is at position 100.For the given queue
           of requests:20,89,130,45,120 and 180.Draw the head movement in FCF
           S,SSTF and CSCAN disk scheduling algorithms and calculate the total
           head movements(in cylinders) in each.