MU Electronics and Telecom Engineering (Semester 6)
Operating Systems
December 2011
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


1 (a) Explain various system calls with appropriate syntaxes
10 M
1 (b) Explain mutual exclusion.Also write note on Petersons algorithm.
10 M

2 (a) Explain Demand Paging.
10 M
2 (b) What are various disk scheduling algorithms? Explain each one in brief.
10 M

3 (a) Explain the page replacement policies. Implement LRU, OPT, FIFO for the following sequence: 0, 1, 2, 4, 3, 7, 1, 4, 2, 3. Also calculate hits and faults
10 M
3 (b) Write note on Buffering Techniques.
10 M

4 (a) What are preemptive and non-preemptive algorithms?
10 M
4 (b) Explain DMA in terms of system concurrency. What is its implication on hardware design?
10 M

5 (a) Write a note on File Access Methods.
10 M
5 (b) Consider the following snapshot.
ProcessAllocationMAXAvailable
P01 3 50 6 56 5 6
P11 0 02 1 3
P22 0 13 4 6
P34 1 11 5 2
P45 4 30 0 1

Answer the following questions:

  1. What is the content of matrix need?
  2. Is the system in safe state?
  3. If process P1 arrives with a request of (4, 5, 3) can the request be granted?
10 M

6 (a) Draw and explain architecture of RTOS.
10 M
6 (b) What is a semaphore? Explain in detail the usage of semaphore and resource acquisition and release.
10 M

7 (c) Monolithic Vs Micro Kernels.

   (d) Shared OS configuration for Multiprocessor System.
10 M
Write Short notes on
7 (a) Race Condition
5 M
7 (b) VM Ware
5 M



More question papers from Operating Systems
SPONSORED ADVERTISEMENTS