UNIT-3 PART-A

Q. No Short Answer Questions

1 Define Process Synchronization.

2 Define Deadlock.
Define semaphore and list different types of semaphores and its
3
operations.
4 Compare deadlock avoidance and deadlock prevention.
5 Define Monitor and give the schematic view of monitor

UNIT-3 PART-B

Q. No Descriptive Questions

Interpret the solution to Readers-Writers problem using

a
semaphores.
1
Discuss in detail about Deadlock detection with multiple resource
b
type.
Interpret the solution to Dining Philosophers problem using
a
2 semaphores.
b Explain in detail about the necessary conditions for deadlock.
Apply Bankers Algorithm for Deadlock avoidance and check
whether the system is in safe state or not. If Safe give the safe
sequence.

a Allocation Max Available

Process
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 2 1 0 0
P1 2 0 0 0 2 7 5 0
3
P2 0 0 3 4 6 6 5 6
P3 2 3 5 4 4 3 5 6
P4 0 3 3 2 0 6 5 2
A system has 3 devices D1, D2 and D3 and 3 processes P1, P2
and P3. P1 is holding D1 and waiting for D3. P2 is holding D2
b and waiting for D1. P3 is holding D3 and waiting for D2. Draw
resource allocation graph and wait-for graph. Is the system in
deadlock state or not? Explain.
a Discuss in detail about deadlock prevention
4
b Describe the two methods for deadlock recovery.
Consider a system that contains 5 processes P1,P2,P3,P4,P5 and 3
5 a resource types A has 10 instances B has 5 instances and C has 7
instances
 Process Allocation Max Available
A B C A B C A B C
P1 0 1 0 7 5 3 3 3 2
P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3
Apply Bankers Algorithm
i)Find the Reference of the Need Matrix
ii) Determine if the system is Safe or not? If system is safe find
the safe sequence.
Discuss in detail about Resource Allocation Graph with and
b
without deadlock using suitable example.

UNIT-4 PART-A

Q. No Short Answer Questions

1 Define Virtual Memory.

2 Articulate the need of Demand Paging?
3 Outline lazy swapping?
4 Define Page Fault.
5 Define Thrashing.
6 List out the different page replacement algorithms.
Summarize the advantages and disadvantages of
7
Contiguous memory allocation.
8 List out the different HDD scheduling algorithms
9 Differentiate between page and frame

10 Summarize the advantages and disadvantages of FCFS

Disk Scheduling.

UNIT-4 PART-B

Q. No Descriptive Questions

Outline the steps for handling page faults with a neat

a
1 diagram.
b A system uses 3-page frames for storing process pages in
 main memory. It uses the Optimal page replacement policy.
Assume that all the page frames are initially empty.
Compute the total number of page faults that will occur
while processing the page reference string given below- 4,
7, 6, 1, 7, 6, 1, 2, 7, 2,1,3,2
a Discuss the concept of Thrashing with its causes and
preventions.
2 Apply FIFO Page replacement algorithm and find the
b number of page faults by considering the page reference
string 6, 7, 5, 2, 7, 3, 7, 4, 2, 3, 7, 3, 2 with 4 page frames.
Analyze the hit ratio and miss ratio by considering the
following page reference string
a 7,0,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0 and assuming three
3 frames, by applying LRU and Optimal Page Replacement
algorithms.
b Explain the concept of virtual memory and demand paging
with a neat diagram.
Illustrate Contiguous memory allocation with a neat
a
diagram.
4 Compare and contrast External fragmentation and internal
b fragmentation. How to solve the fragmentation problem using
paging.
Apply FCFS Disk Scheduling algorithm in which a disk
drive has 200 cylinders, numbered 0 to 199. The drive is
a currently serving a request at cylinder 53. The queue of
5 pending requests, in FIFO order, is 98, 183, 37, 122, 14,
124, 65, 67. Find the Seek Length and average Seek length.
b Discuss in detail about structure of page table.
Apply C-SCAN Disk Scheduling algorithm in which a disk
drive has 200 cylinders, numbered 0 to 199. The drive is
a currently serving a request at cylinder 53. The queue of
6 pending requests, in FIFO order, is 98, 183, 37, 122, 14,
124, 65, 67. Find the Seek Length and average Seek length.
b Explain copy on write technique and its benefits
Apply SCAN Disk Scheduling algorithm in which a disk
drive has 200 cylinders, numbered 0 to 199. The drive is
a currently serving a request at cylinder 53. The queue of
pending requests, in FIFO order, is 98, 183, 37, 122, 14,
124, 65, 67. Analyze the Seek Length and average Seek
7 length
Apply C-LOOK Disk Scheduling algorithm in which a disk
b drive has 200 cylinders, numbered 0 to 199. The drive is
currently serving a request at cylinder 53. The queue of
pending requests, in FIFO order, is 98, 183, 37, 122, 14,
 124, 65, 67. Analyze the Seek Length and average Seek
length
Consider the following page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
8 a How many page faults would occur for FIFO, LRU, Optimal
Page replacement algorithms assuming 4 page frame and all page
frames are initially empty.
Apply LOOK Disk Scheduling algorithm in which a disk
drive has 200 cylinders, numbered 0 to 199. The drive is
a currently serving a request at cylinder 53. The queue of
pending requests, in FIFO order, is 98, 183, 37, 122, 14,
9
124, 65, 67. Analyze the Seek Length and average Seek
length
b List out the advantages and disadvantages of contiguous and
non-contiguous memory allocation
Apply SSTF Disk Scheduling algorithm in which a disk
drive has 200 cylinders, numbered 0 to 199. The drive is
a currently serving a request at cylinder 53. The queue of
10 pending requests, in FIFO order, is 98, 183, 37, 122, 14,
124, 65, 67. Analyze the Seek Length and average Seek
length.
b Explain about mass storage structures

UNIT-5 PART-A

Q. No Short Answer Questions

1 Define File. List different types of files.

2 List different attributes of a file.
3 Predict different directory structures.
4 Differentiate Contiguous and Indexed file allocation
methods.
5 Interpret various operations performed on a file.
6 Define Seek time.
7 Define Field and Record of a file.
8 Explain about Access matrix
9 Define protection and explain the need of protection
10 Differentiate Linked and Indexed file allocation methods.

UNIT-5 PART-B

Q. No Descriptive Questions

a Explain in detail the various operations performed on a file.

1
b Discuss different file access methods.
 Explain the following in detail:
a a. Single Level Directory
2
b. Tree Structured Directory
b Describe in detail free space management techniques.
Explain the following in detail:
a a. Two Level Directory
3
b. Acyclic Graph Directories
b Explain the concept of File Sharing in detail.
a Discuss various types of file allocation methods
4
b Explain in detail about File attributes and file types
a Discuss in detail about file system operations
5
b Explain in detail about file system mounting
a Discuss in detail about goals and principles of protection
6
b What does access control matrix represent? Explain the
implementation of Access control matrix.
a Explain the domain protection mechanism in detail.
7
b Illustrate Indexed allocation with a neat diagram.
a Illustrate Linked allocation with a neat diagram.
8 Illustrate Contiguous memory allocation with a neat
b
diagram.
9 a Discuss in detail about different directory structures
Differentiate between contiguous and indexed file allocation
a
10 methods
b Explain in detail about linked and indexed file allocation methods