CST2555 Coursework 1: Operating Systems 2025 | Middlesex University

Instructions:

1. Write a bash script to solve the following problem.

2. Create a video presentation (6-10 minutes) to:

2.1. Explain your code implementation in detail.
2.2. Execute the script and demonstrate the output.

3. Attach your code and video in a zip folder, then submit it via the provided link.

4. Include your name and student ID in the submission and mention them in the video.

Aim:

Simulate the Banker's Algorithm for Deadlock Avoidance using Bash.

Theory:

The Banker's Algorithm is a deadlock avoidance algorithm. It is named so because it uses a banking analogy to determine whether resources can be safely allocated without leading to a deadlock, similar to how a bank might ensure it has enough funds before approving loans.

Consider a scenario where there are n account holders in a bank, and the total sum of money in all their accounts is S. Whenever the bank needs to grant a loan, it subtracts the loan amount from the total money it has and then checks if the remaining amount is greater than S. This ensures that the bank will have enough money even if all n account holders withdraw their funds simultaneously.

The Banker's Algorithm operates similar in operating systems. When a new process is created, it must specify the maximum number of instances of each resource type it may need. Assume there are n processes and m resource types in the system.