Name: Marnin Samuel Audu

Matric No: U20CS1013

Course: Operating Systems

Title: Assignment 5

1. Resources Allocation Graph: this is a graph drawn to represent the allocation of data in a
system. It gives comprehensive information about all the processes taking ace on the system,
things like holding resources, waiting for resources and whether or not are available to be used.
In process allocation graph the processes are represented by circles and the resources as
rectangles.
2. Dijkstra’s (Banker’s) algorithm: this is an algorithm designed with the aim of deadlock
avoidance it also being know as the avoidance algorithm or deadlock algorithm, it works using a
system to ensure that the no more resources than are needed are in use at a single time
allowing for at least one task to be completed at any given moment.
Information required for Banker’s algorithm
a. Maximum amount of resources required by each task.
b. How much resources each task is currently using.
c. How much resources are left in the system for each process.
3. Starvation with regards to Deadlock: deadlock and starvation are two similar concepts with the
major differences between them being that in deadlock each process holds some resources and
waits for another process to end to hold its resources, while starvation refers to a situation
where one resources hungry high priority task continues consumes the systems resources
preventing lower priority tasks from utilizing it.