AIT/IQAC/Aca/23-24/IAQP USN

ACHARYA INSTITUTE OF TECHNOLOGY

BENGALURU 560107
ASSIGNMENT - II [Academic Year: 2023-2024]
Sub with Code: Operating Systems (BCS303)
Sem/Section: 3rd / A & B Max Marks: 10
Note: Answer all the questions
SL. Questions (Module –II & III) BL CO’S PO’S
No

1 State the dining philosopher’s problem and give a solution for the same, using L2 CO3 PO1
semaphores.
2 Consider the set of process with arrival time, CPU Burst time (in milliseconds) L2 CO2 PO1
and priority shown below (Lower number represents higher priority)
Process Arrival time Burst time Priority
P1 0 10 3
P2 1 1 1
P3 2 2 4
P4 3 1 5
P5 4 5 2
Write the Gantt Chart and sole average waiting time and average turnaround
time for i) SJF (Preemptive) ii) Priority (Preemptive)
Note: Consider Arrival time for both Algorithms
3 Explain Syntax and Schematic view of Monitors. L2 CO3 PO1

4 What is deadlock? What are the necessary conditions for the deadlock to occur? L2 CO3 PO2
How to prevent the occurrence of deadlock? Explain in detail.
5 Assume that there are 5 processes P0 through P4 and 4 types of resources.At L2 CO3 PO2
time T0 we have the following state:

Process Allocation Max Available

A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

Department of Information Science and Engineering, Acharya Institute of Technology, Bengaluru-

560107
 Apply Banker’s algorithm to answer the following:
i) What is the content of need matrix?
ii) Is the system in a safe state?
iii) If a request from a process P1(0,4,2,0) arrives,can it be granted?
SL. Questions (Module –IV) BL CO’S PO’S
No

6 Which are the commonly used strategies to select a free hole from the available L3 CO4 PO2
holes?
7 With neat diagram, explain paging hardware with TLB. L3 CO4 PO2

8 Explain structure of page table with respect to hierarchical paging. L2 CO4 PO2

9 Describe the steps in handling page faults. L2 CO4 PO3

10 Explain a) copy on write process in virtual machine L4 CO4 PO3
b) Discuss FIFO and Optimal page replacement algorithms
SL. Questions (Module –V) BL CO’S PO’S
No
11 List the different operations performed on a directory L1 CO5 PO3

12 Explain briefly the various operations performed on files. L4 CO5 PO3

13 Explain various disk scheduling algorithms with an example. L4 CO5 PO3

14 Explain Contiguous and Linked disk space allocation methods with diagram. L4 CO5 PO3

15 Explain access matrix model of implementing protection in OS L4 CO5 PO3

CO ‘s Statement
CO 1 Describe the structure, functionality and services of operating system
CO 2 Apply appropriate CPU scheduling algorithms to evaluate its performance metrics.

CO 3 Illustrate the various techniques for process synchronization and deadlock handling.
CO 4 Apply the various page replacement algorithms for memory management.
CO 5 Explain the file and secondary storage management strategies for principles of protection

Course-Coordinator Module-Coordinator Test-Coordinator HOD

Signature

Department of Information Science and Engineering, Acharya Institute of Technology, Bengaluru-

560107