Operating System
1) Define a process. Describe the life cycle of a process.
2) Define context switch.
3) Suppose that the following processes arrive for execution at the time indicated :
What is the average waiting time for these processes with –
i) FCFS scheduling algorithm. ii) SJF scheduling algorithm. iii) RR scheduling algorithm.
4) What is critical section problem ? Explain with a suitable example.
5) Explain with examples the difference between premptive and non-preemptive priority scheduling.
6) Explain PCB with a neat diagram.
7) Explain the following file access methods :i) Direct ii) Sequential iii) Indexed Sequential
8) Consider the following sequence of memory references generated by a single program in a pure
paging system : 10, 11, 104, 170, 173, 177, 309, 245, 246, 247, 458, 364. Determine the number
of page faults for each of the following page replacement policies assuming three (3) page frames
are available and all are initially empty. The size of a page is 100 words :
i) LRU
ii) FIFO
iii) Optimal page replacement.
9) Explain Mutual exclusion. Write the first algorithm of mutual exclusion algorithm.
10) What is Belady’s anomaly ? Why does it occur in case of one page replacement algorithm only ?
11) What are the different disk scheduling algorithms ? Mention at least four such algorithms.
12) Write short notes on:
a) Round Robin Scheduling b) Thrashing c) Virtual memory d) Paging and
Segmentation e) Distributed OS f) RAID g) Long term and short term scheduling
h) Thread
13) What are the conditions for deadlock ? Describe a system model for deadlock. Explain Resource
allocation graph algorithm for deadlock avoidance. Discuss deadlock recovery technique.
14) What is semaphore ? How can semaphore be used to enforce mutual exclusion ? Explain
Producer-Consumer problem. Explain Dining Philosopher problem.
15) Explain multilevel queue scheduling.