Scribd
Upload
1 views

Assignment 3

The assignment focuses on evaluating process scheduling algorithms, including criteria for fairness, throughput, and response time. It requires calculating average waiting and turnaround times for different scheduling methods and discussing the Round Robin algorithm's impact on fairness and response time. Additionally, it involves applying the Banker's Algorithm to determine resource allocation and system safety for a set of processes.

Uploaded by

arihanttyagi78
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1 views

Assignment 3

The assignment focuses on evaluating process scheduling algorithms, including criteria for fairness, throughput, and response time. It requires calculating average waiting and turnaround times for different scheduling methods and discussing the Round Robin algorithm's impact on fairness and response time. Additionally, it involves applying the Banker's Algorithm to determine resource allocation and system safety for a set of processes.

Uploaded by

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

Assignment-3

CSE254 Section CS-J


Principles of Operating System

SCHOOL OF ENGINEERING& TECHNOLOGY


(Department of CSE)
ASSIGNMENT NO.- 3

Question Course
S. No
Outcome
Discuss the criteria used for evaluating the performance of a CO 3
process scheduling algorithm. How do you measure
1)
fairness, throughput, and response time?

2) Find the average waiting time and average turnaround time CO 3


using:
a) FCFS
b) SJF(Non-Preemptive)
c) SJF(Preemptive)
d) RR (TQ=3)

Process Burst Time Arrival Time

P1 2 2

P2 6 5

P3 4 0

P4 7 0

P5 4 7

3) Discuss the Round Robin (RR) scheduling algorithm. What CO 3


is the purpose of time quantum, and how does it impact the
fairness and response time of processes?
4) Consider a system with five processes (P1, P2, P3, P4, and CO 3
P5) and three resource types (A, B, and C). The system
currently has the following resource allocation and
maximum need tables:
Allocation Table (Current Allocation)

Process A B C
P1 0 1 0
P2 2 0 0
P3 3 0 2
P4 2 1 1
P5 0 0 2
Maximum Need Table (Maximum Resources Required)

Process A B C
P1 7 5 3
P2 3 2 2
P3 9 0 2
P4 2 2 2
P5 4 3 3
The available resources are:
A = 3, B = 3, C = 2

By applying the banker’s Algorithm

1. Calculate the Need Matrix.


2. Determine if the system is in a safe state.
o If yes, provide a safe sequence.
o If no, explain why.

You might also like