Assignment 2
Assignment 2
Q.No. Question
Consider the following snapshot of the system:
1
Answer the following questions using Banker’s algorithm:
a. What is the content of the need matrix?
b. Is the system in a safe state? If yes, mention the safe sequence.
If a request from process P1 arrives for (0,4,2,0) can the request be granted immediately?
2 What is a semaphore? State a Dining Philosopher problem gives a solution using semaphore
Define deadlock. What are the necessary conditions for deadlock to occur?Explain different
3
methods to recover from deadlocks.
What is a resource allocation graph? Consider an example to explain how it is very useful in
4
describing a deadly embrace.
5 Explain deadlock prevention strategies.
6 Explain Contiguous memory management strategies.
7 Explain demand paging with a neat diagram.
8 What is TLB? Explain TLB in detail with a paging system with a neat diagram.
Consider the page reference string: 1,0,7,1,0,2,1,2,3,0,3,2,4,0,3,6,2,1 for a memory with three
9
frames. Determine the number of page faults using the FIFO.
Given the following sequences 95,180,34,119,11,123,62,64 with the track 50 and ending track
10
199. What is the total disk travelled by the disk arm using LOOK and CLOOK algorithm.
Given the following sequences 95,180,34,119,11,123,62,64 with the track 50 and ending track
11
199. What is the total disk travelled by the disk arm using SCAN and CSCAN algorithm.
What is Access Matrix? Explain access matrix representation of system protection with domain as
12
object and its implementation.
13 Explain file allocation strategies.
14 What is a file? What are its attributes? Explain file operations.
15 With neat diagram explain 2 & 3 level directory strucutures.