Q1. What do you mean by degree of multiprogramming? Explain the multiple partition memory allocation giving its merits and demerits.
Q2. When a process is stated to be in the Zombie state?
Q3. Compare and contrast the Best fit, First fit and Worst fit memory allocation in terms of the internal fragmentation and external fragmentation.
Q4. Sketch a diagram showing state transition of process throughout the execution in a timesharing operating system which permits preemption.
Q5. What do you mean by Belady’s anomaly? For a given reference strings: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. By using FIFO algorithm of page replacement calculate the number of page faults for number of frame = 3 and number of frame = 4.
Q6. Outline the operations which are carried out on a directory. Give merits and demerits of single level, double level and the tree structured directory.
Q7. Explain how file access is controlled in the UNIX operating System. Write down the meaning of 10 characters related with file permissions in the UNIX. Write down the syntax of chmod command.
Q8. Describe the Shortest Seek Time First (SSTF) algorithm and find out the total head movement for seek job queue (98, 183, 27, 122, 14, 124, 65, 67) where the head pointer is at 53.