Question Paper: Operating Systems : Question Paper Dec 2015 - Information Technology (Semester 5) | Mumbai University (MU)
0

Operating Systems - Dec 2015

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.


Attempt any 4 sub questions

1 (a) What are the characteristics of modern operating systems.(5 marks) 1 (b) What is internal and external fragmentation?(5 marks) 1 (c) What is a Process Control Block (PCB)?(5 marks) 1 (d) Define the terms critical section and race condition.(5 marks) 1 (e) Draw and explain process state transition diagram.(5 marks) 2 (a) Explain the conditions for deadlock. Also explain how the deadlock can be determined with the help of resource allocation graph.(10 marks) 2 (b) Explain different kernel architectures in detail.(10 marks) 3 (a) On a disk with 1000 cylinders, number 0-999. Compute the number of tracks the disk arm must move to satisfy all request in the disk queue. Assume the last request received was at track 345 and the head is moving towards track 0. The queue in FIFO order contains request for the following tracks. 123, 874, 692, 475, 105, 376.
Perform the computation for the following scheduling algorithms.
i) FIFO     ii) SSTF     iii) SCAN
(10 marks)
3 (b) Explain different types of schedulers.(10 marks) 4 (a) Explain File Allocation methods in detail.(10 marks) 4 (b) Consider the following page reference string
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 3, 6
how many page faults would occur for the following replacement algorithms assuming three, five frames for LRU, FIFO and Optimal Replacement.
(10 marks)
5 (a) Brief the evolution of an OS.(10 marks) 5 (b) Consider the given snap of the system.
Answer the following questions using Banker's algorithm
i) What is the content of Matrix need?
ii) Is the system in safe state?
iii) If a request from process P1 arrives for (1,3,2,1) can the request be granted immediately?

  Allocation Max Available
  A B C D A B C D A B C D
P0 0 2 1 2 0 3 2 2 2 5 3 2
P1 1 1 0 2 2 7 5 2        
P2 2 2 5 4 2 3 7 6        
P3 0 3 1 2 1 6 4 2        
P4 2 4 1 4 3 6 5 8        
(10 marks)


Write notes on (any two):

6 (a) Multithreading(10 marks) 6 (b) Linux File system(10 marks) 6 (c) Procedure Consumer Problem.(10 marks) 6 (d) RAID.(10 marks)

Please log in to add an answer.