Scribd
Upload
35 views3 pages

MCS-203 (3)

The document is an examination paper for the course MCS-203: Operating Systems, part of the Post Graduate Diploma in Computer Applications (PGDCA). It includes various questions on topics such as deadlocks, scheduling algorithms, file management systems, virtual memory organization, process management in Linux, and semaphore usage. Candidates are required to answer one compulsory question and any three additional questions within a 3-hour time frame for a total of 100 marks.

Uploaded by

Deepak Kumar
Copyright
© © All Rights Reserved
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
35 views3 pages

MCS-203 (3)

The document is an examination paper for the course MCS-203: Operating Systems, part of the Post Graduate Diploma in Computer Applications (PGDCA). It includes various questions on topics such as deadlocks, scheduling algorithms, file management systems, virtual memory organization, process management in Linux, and semaphore usage. Candidates are required to answer one compulsory question and any three additional questions within a 3-hour time frame for a total of 100 marks.

Uploaded by

Deepak Kumar
Copyright
© © All Rights Reserved
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/ 3

No.

of Printed Pages : 3 MCS-203

POST GRADUATE DIPLOMA IN COMPUTER


APPLICATIONS (PGDCA (NEW))
Term-End Examination
June, 2022

MCS-203 : OPERATING SYSTEMS

Time : 3 hours Maximum Marks : 100


(Weightage : 70%)

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Define a Deadlock. Explain the necessary


and sufficient conditions for a deadlock
occurrence. Also explain how it can be
prevented. 10

(b) Write and explain the Lamport’s Scheme of


Ordering of Events in Distributed Systems. 10

(c) Explain the file management system in iOS


and also briefly mention the security
aspects of file system. 10

(d) Describe briefly Virtual Memory


Organization and Demand Paging in
WINDOWS-10. 10
MCS-203 1 P.T.O.
2. (a) Discuss briefly the following Scheduling
algorithms :
(i) FCFS
(ii) Round Robin
(iii) Priority-based Scheduling
Explain the difference in the degree to
which the above scheduling algorithms
discriminate in favour of short processes. 10

(b) Briefly explain the two non-contiguous disk


storage allocation schemes, with the help of
an illustration for each. 10

3. (a) Describe the process management in


LINUX which includes process priorities,
process hierarchy, process states and
threads management. 10

(b) With the help of a simple block diagram,


explain the XNU kernel architecture which
was initially used for Mac OS. 10

4. (a) Define Segmentation Scheme. With the


help of a diagram, explain the principles of
its operation. 10

(b) Define Thrashing and explain the reason of


its occurrence, with the help of an example.
Describe briefly the techniques of
prevention of thrashing. 10

MCS-203 2
5. (a) What is a Semaphore ? Give solution to the
Sleeping Barber Problem using Semaphore. 10

(b) List the contents of a Process Control Block


(PCB). Explain the significance of each of
its components. 10

MCS-203 3 P.T.O.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy