Scribd
Upload
11 views

unit-4

Uploaded by

Kandula Anusha
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

unit-4

Uploaded by

Kandula Anusha
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

4th unit Question paper

1) a). How deadlock can be detected? Explain any one deadlock detection algorithm.
b) What is a Disk? Give the Overview of Disk Structure.
2) a) Elaborate on the necessary and sufficient conditions for deadlock occurrence.
b) Give the comparison of various disk scheduling algorithms.
3) a) How Deadlock Recovery can be done? Explain with a suitable example.
b) Explain about RAID Structure along with its merits and demerits.
4) a) Explain Ostrich Algorithm with an example.
b) How File Systems are Managed and optimized? Explain.
5) a) How does resource allocation graph support Deadlock Avoidance? Explain
b) Explain in detail about the necessity of File System Optimization.
6) a) Explain briefly about Deadlock Recovery.
b) Distinguish between single level, two level and tree structured directories.
7) a) Compare SCAN and C-SCAN disc scheduling algorithms.
b) Explain indexed file allocation method with an example.
8) a) How to recover from deadlock situations? Explain.
b) Discuss about File system Implementation in detail
9) a) What is Deadlock and what are its four necessary conditions? Specify the difference
between Deadlock and Starvation.
b) Briefly explain about Single-level, Two-level and Tree-Structured directory
implementations.
10 ) a) What is the need for page replacement in paging? Describe any 3 page replacement
algorithms with examples.
b) Explain about Memory-mapped files and its types.
11) a) Explain Banker’s algorithm with an example.
b) Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The head is initially at cylinder number 53. The cylinders are numbered from 0
to 199. Find out the total head movement (in number of cylinders) incurred while servicing
these requests with respect to SSTF and CLOOK algorithms.
12) a) Why Ostrich algorithm is considered the best solution for deadlock handling? Explain
the Ostrich algorithm.
b) Explain the following i) File System implementation ii) Stable storage implementation
13) a) Discuss the different ways of aborting a process in order to eliminate deadlocks.
b) Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is
given: 82,170,43,140,24,16,190. Assume that the initial position of the R/W head is on track
50. Calculate the Seek Time for SSTF, SCAN, LOOK.
14) a) Explain and compare the FCFS and SSTF disk scheduling algorithms. [7M] b) Discuss
the different levels of RAID configuration.
15) Consider a system that contains five processes P1, P2, P3, P4, P5 and the three resource
types A, B and C. Following are the resources types: A has 10, B has 5 and the resource type
C has 7 instances.

Answer the following questions using the banker's algorithm:


1. What is the reference of the need matrix?
2. Determine if the system is safe or not.
3. What will happen if the resource request (1, 0, 0) for process P1 can the system accept
this request immediately?
16) a) What is Deadlock? Explain three major approaches for handling deadlocks.
b) Explain Indexed file allocation method. Also discuss its merits and demerits.
17) a) Describe various In-memory and On-Disk structures supporting file system
implementation.
b) Why is Disk Scheduling needed? Explain the following terms related to disk scheduling.
i)Seek Time ii) Rotational Latency iii)Transfer Time iv)Disk Access Time v)Disk Response Time.
18) a) Present the deadlock detection algorithm with example and explain recovery from the
deadlock automatically.
b) Write about file attributes, file types and file structures in detail.
19) a) Consider the following snapshot of a system:
Allocation Max Available
ABCD ABCD ABCD
P0 0 0 1 2 0012 1520
P1 1 0 0 0 1750
P2 1 3 5 4 2356
P3 0 6 3 2 0652
P4 0 0 1 4 0656
Answer the following questions using the banker’s algorithm:
i. What is the content of the matrix Need?
ii. Is the system in a safe state?
iii. If a request from process P1 arrives for (0,4,2,0), can the request be granted
immediately? iv. Find the safe state of system.
b) Present and explain a general overview of the physical structure of secondary and tertiary
storage devices.

You might also like