Operating Systems - May 2016
Computer Engineering (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. 1(a) What is mutual exclusion? Explain its Significance.(5 marks) 1(b) Discuss various scheduling Criteria.(5 marks) 1(c) Explain services provided by operating system.(5 marks) 1(d) Write short note on system calls.(5 marks) 2(a) What is deadlock? Explain the necessary and sufficient conditions for the deadlock. Suggest techniques to avoid deadlock.(10 marks) 2(b) Differentiate the following:
i) Process vs Thread
ii) Preemptive vs Non- Preemptive Scheduling(10 marks) 3(a) Explain the following in brief:
i) Process Synchronisation
ii) Inter-Process Communication (IPC)(10 marks) 3(b) Discuss partition selection algorithm in brief. Given memory partition of 150k,
300k,& 550k (in order), how would each of the first fit, best fit and worst fit algorithm place the processes of 220k,
110k,&425k (in order). Which algorithm makes the most efficient use of memory?(10 marks) 4(a) Find AWT,
ART and AWTAT for the following set of processes with CPU burst time in ms. Assume that all processes arrive at time 0.
i) FCFS with order P2,
ii) Round Robin (Quantum=2ms)(10 marks) 4(b) Explain paging hardware with TLB along-with protection bits in page table.(10 marks) 5(a) Explain various allocation methods with reference to file system?(10 marks) 5(b) Calculate hit and miss percentage for the following string using page replacement policies FIFC,
CRU and Optimal. Compare it for the frame size 3 and 4.
0(10 marks) 6 Write short note on the following:(Any Two)
a) File management in Linux
ii) Belady's anomaly
c) Case study of windows operating system
d) Virtual memory(20 marks)