Scribd
Upload
66 views2 pages

Operating Systems Exam Guide MCS-041

This document is the exam for the course MCS-041 Operating Systems given in December 2012. It contains 5 questions worth 10 marks each, with question 1 being compulsory and students to attempt any 3 of the remaining questions. The questions cover topics like virtual memory systems, bounded buffer problem using semaphores, booting process of Windows 2000, differences between loosely and tightly coupled systems, security models, multiprocessor OSes, Banker's algorithm, page replacement algorithms, Remote Procedure Call implementation, Bakery's algorithm for critical section problem, segmented paging vs paged segmentation and directory structures.

Uploaded by

Dibya Nandi
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
66 views2 pages

Operating Systems Exam Guide MCS-041

This document is the exam for the course MCS-041 Operating Systems given in December 2012. It contains 5 questions worth 10 marks each, with question 1 being compulsory and students to attempt any 3 of the remaining questions. The questions cover topics like virtual memory systems, bounded buffer problem using semaphores, booting process of Windows 2000, differences between loosely and tightly coupled systems, security models, multiprocessor OSes, Banker's algorithm, page replacement algorithms, Remote Procedure Call implementation, Bakery's algorithm for critical section problem, segmented paging vs paged segmentation and directory structures.

Uploaded by

Dibya Nandi
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

No.

of Printed Pages : 2

MCS-041

MCA (Revised)
Term-End Examination

O
-71.4

December, 2012
MCS-041 : OPERATING SYSTEMS

Time : 3 hours

Maximum Marks : 100


Weightage : 75%

Note : Question No. 1 is compulsory. Attempt any three


questions from the rest.

1.

2.

(a) Explain the concept of virtual memory 10


system.
(b)

Write the algorithm for the bounded buffer 10


problem using semaphore.

(c)

Explain the booting process of windows 10


2000 operating system.

(d)

What is the difference between a loosely 10


coupled and tightly coupled system ? Give
suitable examples.

(a) Explain any two security models for


computer system.

10

(b) Explain all types of multiprocessor 10


Operating Systems.

MCS-041

P.T.O.

3.

(a) A system has 10 instances of a resource.


Resource requirement of 3 processes are
given as below :
P1
P2
P3
8
Max. Requirement
7
5
Current Allocation
3
1
3
Is the current allocation in a safe state? If
the new requirement from process P1 of
1 instance arrives, whether the state will
remain in same state ? Apply Banker's
algorithm to answer this question.
(b) Obtain the total page fault using FIFO, LRIJ
and OPT page replacement algorithm for
the following sequence of pages. Consider
total 3 frames in memory.
1, 2, 3, 1, 4, 2, 5, 1, 3, 4, 5.

4.

5.

(a) What is a Remote Procedure Call (RPC)


How is it implemented ?
(b) Write Bakery's algorithm for handling
critical section problem for n processor.

10

10

10
10

(a) Explain segmented paging and paged 10


segmentation.
(b) Explain Multilevels, Acyclic graph and 10
general graph directory structure.

MCS-041

You might also like