Scribd
Upload
152 views

MCS 041

This document is a 4 page exam for the course MCS-041 Operating Systems. It contains 5 questions testing various concepts related to operating systems including scheduling algorithms, demand paging, file systems, disk scheduling, kernels, deadlocks, protection models, and more. Students are asked questions involving short explanations, calculations, comparisons, and examples.

Uploaded by

shivshankar shah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
152 views

MCS 041

This document is a 4 page exam for the course MCS-041 Operating Systems. It contains 5 questions testing various concepts related to operating systems including scheduling algorithms, demand paging, file systems, disk scheduling, kernels, deadlocks, protection models, and more. Students are asked questions involving short explanations, calculations, comparisons, and examples.

Uploaded by

shivshankar shah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

No.

of Printed Pages :

I MCS-041

,-4 N
O

MCA (Revised) Term-End Examination December, 2011 MCS-041 : OPERATING SYSTEMS

Time : 3 hours
Note :

Maximum Marks : 100

Question No. 1 is compulsory. Attempt any three questions from the rest.
(a) For the five given processes arriving at time 0, in the order with the length of CPU time in milliseconds : Process P1 P2 P3 P4 Processing Time 10 28 32 7

1.

10

consider the FCFS, SJF and RR (time slice = 10 milliseconds) scheduling algorithms for the above set of process which algorithm would give the minimum average waiting time and minimum average turn around time ?

MCS 041
-

P.T.O.

(b) (c)

Explain demand paging with the help of suitable diagrams. What is Belady's Anomaly ? In which page replacement algorithm this anomaly occurs ? Explain with an example. Explain file system is UNIX. Elaborate on file and directory permissions in UNIX with examples.

5 5

(d)

(e)

What do you understand by disk scheduling algorithms ? Explain and also calculate the total head movement for FCFS, SSTF and C-SCAN algorithms for the following block sequence : 90, 150, 21, 50, 68, 72, 151, 138. Initially the head is at the cylinder number 50. Draw a suitable set of diagrams to illustrate the algorithm.

10

(f)

What is understood by the kernel of an OS ? What are the classification of an OS based on the Kernel ?

2.

(a) Give a problem statement and a solution on diner philosopher's problem. (b) What is a safe sequence ? Explain Banker's Algorithm for the deadlock avoidance with example.

7 8

MCS-041

(c) What is thrashing ? How it is controlled using working set principle ?

3.

(a) Differentiate between the following :(i) (ii) (b) multiprocessor OS systems. Paging and segmentation.

3x2=6

Master - slave and symmetric

Give a security and protection model for a distributed and network operating system (one model each). Differentiate between the two suggested models.

(c)

Explain the Bakery's Algorithm for critical section problem for n number of processes. Give an example to illustrate the solution.

4.

(a) What are race conditions ? How race condition originates in an OS ? (b) Give a short note on RPC Mechanism (with example). Also suggest any two limitations of it. (c) Differentiate between : (i) (ii)

6 6

4x2=8

Hypercube system and Crossbar system. Segmented paging and paged segmentation.

MCS 041
-

P.T.O.

5.

(a) Give short notes on : (i) (ii) (iii) (iv) Pipes and filters in UNIX. CPU scheduling in a UNIX OS. Overlays. OPT Algorithm.

4x4=16

(b) Differentiate between process and Threads with share.

MCS-041

You might also like