MU Computer Engineering (Semester 5)
Operating Systems
December 2015
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


Attempt any four question:
1 (a) Differentiate between Monolithic and Microkernel.
5 M
1 (b) Explain effect of page size on performance.
5 M
1 (c) Draw and explain five state process models.
5 M
1 (d) Explain disk cache.
5 M
1 (e) Explain "chmod" command in UNIX.
5 M
1 (f) What do you meant by 'Busy Waiting'? What is wrong with it?
5 M

2 (a) Explain in detail file management in UNIX.
10 M
2 (b) Explain dining philosopher problem and solution to it.
10 M

3 (a) What is deadlock? Explain necessary and sufficient conditions to occur deadlock. what is the difference between Deadlock avoidance and prevention?
10 M
3 (b) Consider the following set of process with CPU burst time.
Process Burst Time Arrival Time
P1 10 11
P2 04 2
P3 05 3
P4 03 4

i) Draw Gnatt chart for CFS, SJF pre-emptive and Round Robin (Quantum=0.3). Calculate average waiting time and average turnaround time.
10 M

4 (a) What is Operating System? Explain different functions and objectives of operating system.
10 M
4 (b) What is mutual exclusion? Give software approach for mutual exclusion.
10 M

5 (a) Consider following snapshot at time T0:5 processes P0 through P4.3 resources types A(10 units), B(5 units) and C(7 units).
  ALLOCATION MAX AVAILABLE
  A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2      
P2 3 0 2 9 0 2      
P3 2 1 1 2 2 2      
P4 0 0 2 4 3 3      

i) Compute "Still Need" matrix?
ii) Is system currently in safe or unsafe state? Why?
10 M
5 (b) Explain various I/O buffering techniques.
10 M

6 (a) What is system calls of operating systems? Explain any five systems calls.
10 M
6 (b) Explain techniques of disk scheduling.
10 M



More question papers from Operating Systems
SPONSORED ADVERTISEMENTS