Scribd
Upload
9 views

OS-Assignment2

The document is an assignment for an Operating System course that includes questions on critical section problems, the dining philosopher's problem, deadlock definitions and conditions, and the application of the banker’s algorithm. It also covers concepts of paging with TLB, demand paging, and disk scheduling algorithms with a practical scenario involving a disk drive. Students are required to analyze system states and calculate distances for various disk scheduling methods.

Uploaded by

sumithrachinnu402
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
9 views

OS-Assignment2

The document is an assignment for an Operating System course that includes questions on critical section problems, the dining philosopher's problem, deadlock definitions and conditions, and the application of the banker’s algorithm. It also covers concepts of paging with TLB, demand paging, and disk scheduling algorithms with a practical scenario involving a disk drive. Students are required to analyze system states and calculate distances for various disk scheduling methods.

Uploaded by

sumithrachinnu402
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Operating System (P22CD304)

Assignment -2

Qn.
No.
Questions
1. Write Peterson’s solution to the critical section problem.
2. Explain the solution to solve the dining philosopher’s problem.
3. Define deadlock. Explain the necessary conditions for a deadlock to occur.
Given a system with a total resources of R1 (9), R2 (9), R3 (10) and R4 (6). Consider the
following snapshot of the system.

Process Allocation Max


R1 R2 R3 R4 R1 R2 R3 R4
P1 2 2 3 1 6 7 6 3
P2 2 0 2 2 7 5 7 6
4. P3 1 2 0 0 2 3 0 0
P4 2 2 2 1 4 7 5 3
P5 1 2 0 0 3 5 3 1

Use banker’s algorithm to answer the following questions.


a) Is the system is in a safe state?
b) Can the request made by process P4 (0, 1, 2, 1) be granted safely?

Explain the concept of paging with TLB with neat diagram.


5.
Define demand paging? Describe the procedure for handling the page fault with neat
6. labeled diagram.

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently
serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The
queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356,
1,523, 4,965, 3681.
7.
Starting from the current head position, what is the total distance (in cylinders) that the
disk arm moves to satisfy all the pending requests for each of the following disk-scheduling
algorithms? a. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN f. C-LOOK

You might also like