MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE

DEPARTMENT OF CSE
III B.Tech – A Sem – 1 2019-20
14CSU110 Operating Systems
Assignment – 2

Reg. Number Questions

16691A0511, 1. What is deadlock? Explain deadlock Avoidance in detail.
16691A0549, 2. Explain with the help of examples FIFO and LRU, optical page
16691A05B8,
16691A05G4, replacement algorithms with example reference string. Mention
17695A0503 the merits and demerits of each of the above algorithm.
3. Explain about single-level, two-level directory structure?

17691A0501, 1. Explain dinning philosopher synchronization problem in detail.

17691A0502, 2. Explain how paging supports virtual memory. With neat diagram
17691A0503,
17691A0506, explain hoe logical address is translated into physical address
17691A0507, 3. Briefly explain the different file allocation methods.
17691A0509
17691A0510, 1. Explain the concept of semaphores in detail. Illustrate the
17691A0511, working principle of producer-consumer problem and determine
17691A0512,
the advantages of using semaphores in producer-consumer
17691A0514,
17691A0515, problem.
17691A0516 2. List out the steps which are to be followed when the process
requires any of the page that is not loaded into the memory.
Explain the idea behind the demand paging.
3. Explain the different directory level hierarchy with its limitations
and advantages. Enumerate the operations involved in directory.

17691A0517, 1. Define the term deadlock. Explain various necessary conditions

17691A0519,
for a deadlock to occur. Explain in brief about deadlock
17691A0520,
17691A0521, prevention.
17691A0522, 2. What is the need of Page replacement? Consider the following
17691A0523 reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1.
Find the number of Page Faults with FIFO, Optimal Page
replacement and LRU with four free frames which are empty
initially. Evaluate which algorithm gives the minimum number of
page faults?
3. Explain in detail the various Algorithms of Disk Scheduling with an
example.
17691A0524, 1. Explain Banker's deadlock-avoidance algorithm with an example
17691A0527,
17691A0528, 2.Consider the following reference string:
17691A0529,
17691A0530,
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would occur
17691A0531 for the following page replacement algorithm assuming 3 page frames:
i) LRU ii) Optimal Page Replacement.
Explain different disk scheduling methods with the following Work Queue:
23, 89, 132, 42, 187.
3.There are 200 cylinders numbered from 0 – 199. The disk head
stars at number 100
17691A0532, 1. Consider deadlock situation in dining philosopher’s problem.
17691A0534, Discuss how necessary conditions indeed hold in sitting and also
17691A0535,
how they are avoided?
17691A0537,
17691A0538, 2. Explain basic concept of memory allocation using paging. Explain
17691A0540 demand paging with a neat diagram.
3. Explain Tree-structured directory and Acyclic-graph directory with
a neat Diagrams.
17691A0541, 1. Explain any two process synchronization algorithms in detail.
17691A0542, 2. Illustrate and explain any two page replacement algorithms.
17691A0543,
17691A0544, 3. Explain about file system implementation in modern computers.
17691A0546,
17691A0548
17691A0549, 1. Explain various deadlock avoidance algorithms in modern
17691A0550,
operating systems.
17691A0551,
17691A0552, 2. Explain the two level page management in computer operating
17691A0553, systems.
17691A0554
3. Describe any two disk scheduling algorithms.

17691A0557, 1. Discuss on process Synchronization. Illustrate any two classical

17691A0558,
17691A0559,
Problems of Synchronization.
17691A0560, 2. Explain paging scheme for memory management, illustrate the
18695A0501 hardware support for Paging and explain the concept of
paging with an example.
3. Explain C-SCAN and look disk scheduling algorithms. Illustrate with
examples.