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