Scribd
Upload
6 views3 pages

Scheduling Algorithms and Deadlock Solutions

The document contains a question bank focused on scheduling algorithms, critical section problems, deadlocks, and synchronization methods in operating systems. It includes tasks such as calculating average waiting and turnaround times using various scheduling algorithms, explaining concepts like the critical section problem and deadlocks, and providing examples of solutions like Peterson's solution and semaphore usage. Additionally, it addresses resource allocation graphs and methods for deadlock recovery.

Uploaded by

sidharthsathish06
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Scheduling Algorithms and Deadlock Solutions

The document contains a question bank focused on scheduling algorithms, critical section problems, deadlocks, and synchronization methods in operating systems. It includes tasks such as calculating average waiting and turnaround times using various scheduling algorithms, explaining concepts like the critical section problem and deadlocks, and providing examples of solutions like Peterson's solution and semaphore usage. Additionally, it addresses resource allocation graphs and methods for deadlock recovery.

Uploaded by

sidharthsathish06
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Module 2 Question Bank

1. Explain Scheduling Criteria

2. Calculate the average Waiting time and average turnaround time by


drawing Gantt Chart using FCFS, SRTF, RR(q=2ms) and priority
algorithms. Lower priority number represents the higher priority

Process Arrival Time Burst Time Priority


P1 0 9 3
P2 1 4 2
P3 2 9 1
P4 3 5 4

3. Calculate average waiting and turnaround times by drawing the


Gantt
chart using FCFS and RR (q=2ms).

Process Arrival Time Burst Time


P1 0 9
P2 1 4
P3 2 9
P4 3 5

4. Calculate the average waiting time and the average turnaround


time by drawing the Gantt chart using SRTF and the Priority
scheduling algorithm.

Process Arrival Time Burst Time Priority


P1 0 8 3
P2 1 4 2
P3 2 9 1
P4 3 5 4
5. Explain in detail about Multiple -processor scheduling with example
6. Consider the following set of four process with length of CPU burst
given in ms

Process Burst Time


P1 24
P2 3
P3 3
Compute the average waiting time and average turnaround time for
the above process using FCFS algorithm
7. What is critical section problem? What are the requirements for the
solution to critical section problem? explain Peterson’s solution
8. Illustrate Peterson’s solution for the critical section problem.
9. Define deadlock. What are the necessary conditions for deadlock to
occur?
10. Consider the following snapshot of the system:

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?
11. Explain different methods to recover from deadlocks.
12. What is a resource allocation graph? Consider an example to explain
how it is very useful in describing a deadly embrace.
13. What is a semaphore? State a Dining Philosopher problem gives a
solution using semaphore.
14. Discuss briefly about semaphores in synchronization
15. Discuss briefly about deadlocks characteristics with example
16. explain the requirements must satisfy to critical section problem
4m
17. explain syntax and schematic view of monitors
18. what are necessary conditions for deadlock
4m
19. explain different methods to recovery from deadlocks
20. explain readers – writes problem using semaphores
21. consider the following snapshot of a system

You might also like