12178

21112 3 Hours / 100 Marks

Instructions : (1) (2) (3) (4) (5)

Seat No.

All Questions are compulsory. Answer each next main Question on a new page. Illustrate your answers with neat sketches wherever necessary. Figures to the right indicate full marks. Assume suitable data, if necessary.

1.

Marks Attempt any TEN : 10 2 = 20 (a) What is distributed system ? 2 (b) Enlist any four system calls related with memory management. 2 (c) What is a context switch ? Define. 2 (d) State types of scheduling. 2 (e) Enlist Direct Methods of deadlock prevention. 2 (f) What is meant by clustered system ? 2 (g) State the role of operating system in process communication. 2 (h) List models of threads. 2 (i) What is meant by page fault ? 2 (j) State any four operations, which can be performed on the file. 2 (k) Explain the concept of Demand Paging in brief. 2 (l) Enlist free space memory management techniques. 2 (m) Write down any two disadvantages of priority based scheduling. 2 (n) Draw process state diagram with neat labellings. 2 Attempt any TWO : (a) Explain in detail, various generations of operating system. (b) Explain : (i) Monolithic operating sys. structure (ii) Layered OS structure (c) Describe the terms : (i) Scheduling queues (ii) Scheduler (iii) Thread (iv) Multithreading 2 8 = 16 8

2.

8
P.T.O.

12178

[2]

3.

Attempt any TWO : 16 (a) (i) List services provided by operating system and explain any four of them. 4 (ii) Explain the concept of Inter-process communication. 4 (b) What is a process ? Describe process creation and termination alongwith necessary conditions. 8 (c) Explain the following deadlock avoidance algorithm : (i) Bankers algorithm (ii) Resource Request algorithm 8 Attempt any TWO : 16 (a) Explain any two page replacement algorithms with their advantages and disadvantages. 8 (b) What are the different file allocation methods ? Explain any one in detail with examples. 8 (c) Consider the following set of processes with arrival time as shown below : Arrival time CPU burst (in Ms) P1 2 0 8 P2 3 1 4 P3 1 2 9 P4 4 3 5 Find out Average waiting time by using (i) Non Pre-emptive SJF (ii) Pre emptive SJF (iii) Non-Pre emptive priority and (iv) Pre emptive priority scheduling algorithm Process Priority

4.

5.

Attempt any TWO : 16 (a) Explain different characteristics of following operating systems : 8 (i) Windows XP (ii) Window 7 (b) What are system calls ? Explain system call implementation with its working. 8 (c) State and explain multithreading models with diagram. 8 Attempt any TWO : 16 (a) Explain in detail how deadlocks can be handled. 8 (b) Explain in detail any two directory structure with its advantages & disadvantages. 8 (c) Consider swapping system in which memory consists of the following hole size or partition sizes in memory order as 10 kB, 4 kB, 20 kB, 18 kB, 7 kB, 9 kB, 12 kB, 15 kB. Using different methods, find out which partition is selected for successive segment request of 8 (1) 12 kB (2) 10 kB (3) 9 kB for (a) first fit (b) best fit (c) worst fit ___________

6.