Scribd
Upload
6 views1 page

Mtech 1 Sem Advanced Operating Systems r16 Jan 2017

The document outlines the structure of the M.Tech. I Semester Regular Examinations for Advanced Operating Systems, including a list of topics and questions for students to answer. It covers various aspects of operating systems, such as communication primitives, deadlock detection, distributed file systems, failure recovery, access control, interconnection networks, and concurrency control. Each question carries equal marks, and students are required to answer any five questions within a three-hour time frame.

Uploaded by

Prudhvi
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
6 views1 page

Mtech 1 Sem Advanced Operating Systems r16 Jan 2017

The document outlines the structure of the M.Tech. I Semester Regular Examinations for Advanced Operating Systems, including a list of topics and questions for students to answer. It covers various aspects of operating systems, such as communication primitives, deadlock detection, distributed file systems, failure recovery, access control, interconnection networks, and concurrency control. Each question carries equal marks, and students are required to answer any five questions within a three-hour time frame.

Uploaded by

Prudhvi
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/ 1

Code No: I0504/R16

M.Tech. I Semester Regular Examinations, January-2017


ADVANCED OPERATING SYSTEMS
(Common to Computer Science and Computer Science & Engineering)
Time: 3 Hours Max. Marks: 60
Answer any FIVE Questions
All Questions Carry Equal Marks

1. a List out communication primitives and briefly explain design issues in remote [6]
procedure calls.
b State and prove Huang’s Termination detection algorithm. [6]

2. a Analyze the performance of Singhal’s heuristic algorithm by explain it briefly. [6]


b Discuss hierarchical deadlock detection algorithms in detail. [6]

3. a Explain applications of agreement algorithms. [6]


b Describe the mechanisms for building distributed file systems. [6]

4. a Give the advantages of distributed shared memory by explaining its architecture. [6]
b Discuss the four components of a load distributing algorithm. [6]

5. a Define failure recovery. Explain about classification of failures. [6]


b Explain rollback recovery algorithm. [6]

6. a Briefly explain access control list method with its implementation. [6]
b Explain public key cryptography in detail. [6]

7. a Discuss various types of interconnection networks for multiprocessor systems. [6]


b Write short notes on the following: [6]
i) User-level threads
ii) Kernel-level threads

8. a Discuss briefly serializability theory. [6]


b Explain timestamp based concurrency control algorithms. [6]

*****

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