Mumbai University question papers
IV Sem CSE, Examination June 2009
N.S.: (1) Question NO.1is compulsory.
(2) Attempt any four questions from remaining six questions.
(3) Illustrate answer with sketches wherever required.
1. (a) What is operating system? Explain in brief the evolution of operating system over the years.
(b) What are the objectives and functions of O.S? Explain in brief ‘Modern Unix Kernel’.
2. (a) Explain multiprocessor scheduling.
(b) Explain in details reasons for process creation and process termination.
3. (a) Which of the following scheduling algorithms could result in starvation?
(i) First-Come, First Serve (iii) Round Robin
(ii) Shortest Job First (iv) Priority.
(b) Consider the following set of processes, with the length of CPU burst given in milliseconds :-
Process Burst time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
Ps 5 2
The processes are assumed to have arrived in the order Pl’ P2′ P3′ P4′ Ps all at time 0.
i) Draw Gantt charts for: FCFS, SJF, non-preemptive priority and RR (Quantum = 1). .
(ii) What is turn around time of each process for each of the above algor,ithms (FCFS, SJF, priority, RR)?
(iii) What is the time of each process for each of above algorithms: (FCFS,SJF,priority, RR)?
(iv) Which algorithm results in the minimum average waiting time?
4. (a) What is deadlock ? Explain various deadlock prevention techniques.
(b) Explain various I/O buffering techniques.
5. (a) Explain paging in details. Describe how logical address converted into physical address.
(b) Calculate hit and miss using various page replacement policies (LRU, OPT, FIFO)
for’following page frame sequence, page frame size is 3.
0,4,3,2,1,4,6,3, 0, ~ 9, 3, 8, 5.
6. (a) Explain file allocation methods in details.
(b) What are the characteristics of real-time operating system? Explain in brief the real time scheduling.
7. Write a short notes on :-
(a) File access method