Operating Systems - May 2013
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 disk scheduling? Explain various disk scheduling algorithms.(10 marks) 1(b) Explain various system calls with appropriate syntaxes.(10 marks) 2(a) Explain necessary and sufficient conditions for deadlock, also explain how a resource allocation graph determines a deadlock. (10 marks) 2(b) What is Kernel? Describe briefly the approaches of designing Kernel (10 marks) 3(a) Draw and explain architecture of RTOs.(10 marks) 3(b) Explain programmed I/O and DMA(10 marks) 4(a) What is semaphore? Explain different types of semaphores.(10 marks) 4(b) Write a short note on File Access Methods.(10 marks) 5(a) What is mutual exclusion? Explain Peterson's algorithm for mutual exclusion. (10 marks) 5(b) What are the characteristics of real time system?(10 marks) 6(a) What are pre-emptive and non-pre-emptive algorithms? Explain any two with the help of example. (10 marks) 6(b) Write a short note on buffering techniques.(10 marks)
Write short notes on the following:-
7(a) User threads and Kernel threads. (5 marks) 7(b) Race conditions. (5 marks) 7(c ) Demand paging. (5 marks) 7(d) Monitor(5 marks)