written 8.7 years ago by |
Operating Systems - Dec 2014
Information Technology (Semester 5)
TOTAL MARKS: 80
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
Answer any four:
1 (a) Differentiate: Monolithic kernel and Micro kernel.(5 marks)
1 (b) Discuss I/O buffering in detail.(5 marks)
1 (c) Explain Semaphore.(5 marks)
1 (d) Write short note on: producer-consumer problem.(5 marks)
1 (e) Compare and contrast: thread and process.(5 marks)
2 (a) What is Deadlock? State necessary conditions for deadlock. How to prevent deadlock?(10 marks)
2 (b) Draw process state transition and explain the following transitions:
i) Running to ready
ii) Waiting to ready
iii) Running to waiting
iv) Blocked to ready
v) Running to terminated(10 marks)
3 (a) Calculate Hit and Miss using LRU, Optimal, FIFO page replacement policies for the following sequence. Page frame size is 3.
0,4,3,2,1,4,6,3,0,8,9,3,8,5.(10 marks)
3 (b) Explain the allocation methods in details with proper diagram.(10 marks)
4 (a) Use following scheduling algorithms to calculate ATAT and AWT for the following processes.
i) FCFS
ii) Pre-emptive and non pre-emptive SIF
iii) Preemptive priority.
Process | Arrival Time | Brust Time | Priority |
P1 | 0 | 8 | 3 |
P2 | 1 | 1 | 1 |
P3 | 2 | 3 | 2 |
P4 | 3 | 2 | 3 |
P5 | 4 | 6 | 4 |
(i) How many resources to type A,B,C and D are there?
(ii) What are the contents of Need Matrix?
(iii) Is the system is in safe state? find the state sequence if it is.
Process
| Max A B C D | Allocation A B C D | Available A B C D |
P0 | 6 0 1 2 | 4 0 0 1 | 3 2 1 1 |
P1 | 1 7 5 0 | 1 1 0 0 | |
P2 | 2 3 5 6 | 1 2 5 4 | |
P3 | 1 6 5 3 | 0 6 3 3 | |
P4 | 1 6 5 6 | 0 2 1 2 |
Write short notes on: (any four)
6 (a) Characteristics of Modern operating system(5 marks) 6 (b) RAID(5 marks) 6 (c) Android OS(5 marks) 6 (d) Distributed operating system(5 marks) 6 (e) I-node(5 marks)