Question

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.

15 Apr 2024
Answer :
Word Count : 1112

Banker's Algorithm is a resource allocation and deadlock avoidance algorithm that's used in operating systems to ensure that the allocation of resources doesn't lead to a deadlock situation. It's primarily used in a multi-process and multi-resource environment where processes request a certain number of resources and the system needs to determine whether granting these resources would lead to a safe state, meaning that no deadlock would occur.

Here's a C program implementing the Banker's Algorithm:

```c
#include <stdio.h>

#define MAX_PROCESSES 10
#define MAX_RESOURCES 10

int available[MAX_RESOURCES];
int maximum[MAX_PROCESSES][MAX_RESOURCES];
int allocation[MAX_PROCESSES][MAX_RESOURCES];
int need[MAX_PROCESSES][MAX_RESOURCES];
int n_processes, n_resources;

// Function to check if the requested resources can be granted or not
int is_safe(int process, int request[]) {
    int work[MAX_RESOURCES];
    int finish[MAX_PROCESSES] = {0};
    int i, j;

    // Initialize work to available
    for (i = 0; i < n_resources; ++i)
        work[i] = available[i];

    // Check if request <= need
    for (i = 0; i < n_resources; ++i) {
        if (request[i] > need[process][i])
            return 0;
    }

    // Check if request <= available
    for (i = 0; i < n_resources; ++i) {
        if (request[i] > work[i])
            return 0;
    }

    // Simulate resource allocation and check for safety
    for (i = 0; i < n_resources; ++i) {
        work[i] -= ________ _____ _______ ________ _________ _______ ______ ________ ______ _____ _____ ____.
______ _________ _________ _____ _____ _______ _______ _________ ________ ________ ________.
_____ _________ __________ __________ _____ __________ ______ ______ ________ _____ ______ ____.
_________ __________ ______ _____ _______ ___ ____ ____ _______ _______.
__________ ________ _________ _____ ______ ____ ______.
________ _________ ________ ______ _______ _________ _______.
__________ ___ ___ _____ _____ ___ _______ ________.
___ _______ _________ _____ ____ _____ ______ ________ ________ ______ ____.
_______ ______ ____ _______ _____ _____ _______ _____ ____ ____ ____.
_________ ____ __________ ________ _____ ______.
____ ___ _____ ____ ____ ______ ________ _____ _____.
____ ______ __________ _______ ____ ______ _________ __________.
___ ________ __________ ____ ______ ______ _________ _______ _________ ____.
________ ______ ___ _____ ______ ________ __________ ____ _______ ______ __________ ______.
__________ _________ _________ _________ ______ _________ ______ __________ ______.
_______ __________ _________ ________ ___ _____ __________ ______ ___ ________ __________ ________.
_____ _____ ____ _______ ________ _________ ___ _____ ___ ____ _______.
__________ __________ _____ ______ __________ ________ _____ _________ _______ _____.
_____ ________ ___ ______ _________ __________ ____.
___ __________ ____ _______ _______ _________.
___ __________ ______ ________ _____ _____.
________ ______ _____ ________ _________ _____ _______.
_______ ___ ________ ______ ________.
_____ _______ _________ __________ _______ ___ _______ ___ ______ _________ ___.
_________ ___ _______ ______ ______ ____ ____ ________ _______.
______ ________ ______ _________ _______ ________ _________ ___ _______ ___.
________ ______ _____ _______ _______ ____ _____ _____ ____ __________.
________ ______ ________ _______ ______ ________ ______ ______.
_______ ____ ___ _____ _________ __________ _____ ________ ________ ____ __________ _________.
______ __________ ____ ________ ______.
_________ _________ _______ ___ _______.
_________ ______ _________ _______ ____ ___ __________ ________ __________ ______ _________.
_____ ______ ____ ____ ________ ______.
___ _______ _______ ________ _________ ______.
_____ __________ _________ __________ ____ _______ ____ ____ ______ ______ _____ _______.
__________ _________ ______ ___ _____ _________ _______ _________ ___.
_____ ______ ______ ________ ________ _________ ____ ________ _______ ______.
__________ ____ ______ _____ _____ ______ _____ __________ ____ _____ ______.
______ ___ _________ _________ ________ _________ _________ _________ _________ _____ ____.
________ ________ ___ ____ _____ _________ ____ ___ ___.
______ ____ __________ _______ _______ ______ ________ __________ _________ _______ __________.
____ _____ ________ ___ ________ __________ ____.
____ _____ ________ _____ ________.
_____ _______ ___ __________ ___.
_________ ________ ______ __________ __________ _________ _____ __________.
__________ _________ ________ ______ ________ ___ _____ ________ _______ __________.
______ _________ ______ ___ _________ ________ ______ ___ ____ ________ ________ _______.
___ _______ _______ _________ _______ ________ _________ _______ __________.
_________ ___ _____ _____ _________ _________ _________.
___ __________ _________ __________ _______.
_________ _______ _____ __________ ________.
________ ___ _________ _____ _______ ___ __________ _________ ____ _________.
______ ________ ____ _______ ______ ______.
_____ ________ __________ _________ _________ _____ ___ _________ _____.
__________ ____ __________ _________ _____ _____ ____ ______ _______ ________.
______ ______ _______ _____ ___ _____ ____ _________.
____ ________ ______ __________ _________ ____ __________.
_________ ________ ____ _______ ________ ______ ____.
_____ _____ _______ _______ __________ _________ __________ __________ _______ __________.
___ ________ _______ _____ _____ __________ ____ _______ __________ ___.
________ _______ ________ __________ _________ ____.
_____ ____ __________ _________ ___ _______ _______ _______.
______ ________ ___ _________ _______ _______ ________ _____.
____ __________ _________ ____ _________.
_______ _____ _____ _________ _________ ______ ______ _____ _______ ______ ______ _______.
____ ____ _______ ___ ______ _________ ______.
_________ ________ _____ ____ _____ ____ ________ ____ _______.
_________ _____ _________ _______ __________.
_________ ______ ____ __________ ______ __________ __________.
_____ _________ __________ ________ ________ ______ ______ ____ __________ __________ ___ __________.
________ _________ _________ ____ ___ ____ ________.
______ _______ _________ ____ ___ _______ __________ __________.
__________ ____ ______ _________ _____ ____.
__________ _____ _______ _____ _______ ______ _________ _______ _________ _____ _____.
_________ ________ _____ ______ __________ ________ _____ ____ ___.
____ ______ ______ ____ ______ __________ _____ ___ ___ __________ _________.
__________ ________ ___ ________ ______ ________ ___ ________ _________ ____ ____.
_______ _______ __________ ___ ____ _______ ________ ____ _________ __________ _______ _________.
___ ____ ________ ________ _____ ______ ____ __________ _________.
____ _____ ___ _____ ___.
________ ____ ______ ___ ________ ________ ___ ______ _____.
________ ______ ___ __________ _______ ________ ______.
___ ____ ____ __________ ____ _______ __________ ______.
________ ________ _____ __________ __________ ________ ________ ________ ___.
________ _____ ______ __________ __________ ____ ____ _______.
___ ______ _______ _____ _________.
____ _________ _______ ___ _____ ________ _______ __________.
______ _____ ___ ______ ________ _____.
__________ ___ ___ __________ _______.
________ _______ __________ _______ _________.
_____ ________ _____ __________ ____ _________ ____ ________ __________ ______.
_________ _____ ____ ___ _____ _________ _______ __________ ________.
_________ ______ ____ ________ ___ _________ ____ ________ _____ _______.
______ _____ ________ _______ _________ _____ ____ ______ _________ ______.
_____ _________ _________ _____ ________ _______ ____ ________ ________.
____ _______ ____ _________ _________ ___ ____ ______ _____.
______ ___ ______ ___ ________ _______ __________ _________.
_________ _______ ___ ___ _____ _____ _____ ___.
Get Full Answer on WhatsApp

Related Questions

Write about the features of LuneOS. Also, discuss the process management, memory management and security management functions of LuneOS Mobile Operating System(GNU-General Public Licence).

Consider the following page-reference string:

       1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6

How many page faults would occur for the following replacement algorithms, assuming three frames? Remember all frames are initially empty

a. FIFO replacement b. LRU replacement c. Optimal

Mention the merits and demerits of each of the above algorithms.

 

Draw corresponding Gantt charts illustrating the execution of these processes using FCFS, SJF,
SRTN, Priority based scheduling/even-driven scheduling and Round Robin (quantum=2) scheduling
algorithms

Consider the following set of processes, with the length of the CPU burst time given in milliseconds.

Process Burst
time		 Priority
P1 8 3
P2 3 1
P3 4 4
P4 7 2
P5 6 5

The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5 and

 all of them have arrived at time 0.

a. Draw corresponding Gantt charts illustrating the execution of these processes using FCFS, SJF, SRTN, Priority based scheduling/even-driven scheduling and Round Robin (quantum=2) scheduling algorithms.
b. What is the turnaround time of each process for each of the scheduling algorithm in (a)?
c. What is the waiting time of each process for each of the scheduling algorithm in (a)?
d. Which of the schedules in (a) results in minimal average waiting time (overall processes)? 

Consider the following set of processes, with the length of the CPU burst time given in milliseconds

 

   Process

      Burst  time           Priority
        P1                   8                      3
        P2                   3                      1
        P3                   4                      4
        P4                   7                     2
        P5                   6                     5

 

Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly. 

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers
Login Cart
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance Write a program in C to implement Banker’s Algorithm to avoid De
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→