Operating Systems - May 2016
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.
Solve any four out of five sub questions
1(a) What are the major functions carried out by an operating system?(5 marks) 1(b) Describe the types of semaphores.(5 marks) 1(c) Discuss the problem of consumer-producer.(5 marks) 1(d) Explain various process scheduling queues.(5 marks) 1(e) Differentiate between internal and external fragmentation.(5 marks) 2(a) Briefly explain the different kernel architectures.(10 marks) 2(b) State the necessary conditions for deadlock. How to prevent the deadlock?(10 marks) 3(a) Calculate number of page faults and page hits for the page replacement policies FIFO, Optimal & LRU for given reference string 6,0,5,2,0,3,0,4,2,3,0,3,2,5,2,0,5,6,0,5(assuming three frame size).(10 marks) 3(b) Discuss the various file alocation methods.(10 marks) 4(a) What is mutual exclusion? Explain peterson's algorithm for mutual exclusion.(10 marks) 4(b) Explain the file systems of windows and Linux operating system.(10 marks) 5(a) Assume that the disk head is initially positioned over track 100. For the disk space request of 27,129,110,186,147,41,10,64 and 120. Show how disk scheduling is carried out for SSTF, C-SCAN, C-LLOK. Calculate the average seek length and show the tracing of the requests.(10 marks) 5(b) Define the terms Critical section, Race condition, Process Control Block, Kernel and shell of oS, Context Switch.(10 marks) 6(a) Comparison between FCFS & SJF scheduling algorithms.(6 marks) 6(b) Paging and segmentation.(8 marks) 6(c) Process state diagram(6 marks)