MU Computer Engineering (Semester 5)
Operating Systems
May 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


Solve any five (each question carries 2 marks):
1 (a) (i) Differentiate between monolithic and micro kernel.
2 M
1 (a) (ii) Explain effect of page size on performance.
2 M
1 (a) (iii) Draw and explain five state process model.
2 M
1 (a) (iv) What is paging?
2 M
1 (a) (v) What is thrashing?
2 M
1 (a) (vi) Explain data structures used in Banker algorithm.
2 M
1 (b) Explain Linux OS with respect to Kernel, memory management and scheduling.
10 M

2 (a) Explain different file access methods.
10 M
2 (b) Explain critical section problem with its different solutions.
10 M

3 (a) What is deadlock? Explain necessary and sufficient condition for deadlock to occur. Explain deadlock avoidance, prevention and detection.
10 M
3 (b) The requested tracks in the order received are - 54, 57, 40, 20, 80, 120, 150, 45, 180. Apply the following disk scheduling algorithm starting track at 90.
i) FCFS
ii) SSTF
iii) C-SCAN
10 M

4 (a) What is operating system. Explain different functions and objectives of operating system.
10 M
4 (b) Consider the following snapshot of a system.
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

Answer the following questions using Bankers algorithm.
(a) What is the content of the matrix need?
(b) Is the system in safe state?
(c) If the request from PI arrives for (1,0,2) can the request be granted immediately.
10 M

5 (a) What is paging? Explain LRU, FIFO, OPT page replacement policy for the given page frame sequences. Page frame size is 4.
2,3,4,2,1,3,7,5,4,3,2,3,1
Calculate page hit and page miss.
10 M
5 (b) What is mutual exclusion? Give software approaches for mutual exclusion.
10 M

6 (a) What are system cells? Explain any five system col's.
10 M
6 (b) Explain how readers/writers problem can be solved using snaphores.
10 M



More question papers from Operating Systems
SPONSORED ADVERTISEMENTS