https://angelvyas.com/tags/os/Recent content in os on Angel VyasHugo -- gohugo.ioenWed, 11 Jun 2025 00:00:00 +0000https://angelvyas.com/posts/exam/os/Wed, 11 Jun 2025 00:00:00 +0000https://angelvyas.com/posts/exam/os/ Banker's Algorithmsssss 1#include <stdio.h> 2 3int main() { 4 int n = 5; // Number of processes 5 int m = 3; // Number of resource types 6 int i, j, k; 7 8 int alloc[5][3] = { 9 { 0, 1, 0 }, // P0 10 { 2, 0, 0 }, // P1 11 { 3, 0, 2 }, // P2 12 { 2, 1, 1 }, // P3 13 { 0, 0, 2 } // P4 14 }; 15 16 int max[5][3] = { 17 { 7, 5, 3 }, // P0 18 { 3, 2, 2 }, // P1 19 { 9, 0, 2 }, // P2 20 { 2, 2, 2 }, // P3 21 { 4, 3, 3 } // P4 22 }; 23 24 int avail[3] = { 3, 3, 2 }; // Available Resources 25 26 int newRequest[5][3] = {0}, ProNo; 27 28 printf("Banker's Algorithm\n"); 29 30 printf("For the new request: enter process number (0 to 4)\n"); 31 scanf("%d", &ProNo); 32 33 printf("Enter the new request of process P%d in the order resources [A B C]\n", ProNo); 34 scanf("%d", &newRequest[ProNo][0]); 35 scanf("%d", &newRequest[ProNo][1]); 36 scanf("%d", &newRequest[ProNo][2]); 37 38 // Check if request is less than or equal to available 39 if (newRequest[ProNo][0] > avail[0] || 40 newRequest[ProNo][1] > avail[1] || 41 newRequest[ProNo][2] > avail[2]) { 42 printf("Request cannot be granted now as it exceeds available resources.