From 4dfb156cb1291d1ac3962fca707f80e98455351a Mon Sep 17 00:00:00 2001
From: faaizbinnazir <44573202+faaizbinnazir@users.noreply.github.com>
Date: Thu, 10 Oct 2019 23:57:34 +0530
Subject: [PATCH] Delete Bankers.txt

---
 Bankers.txt | 154 ----------------------------------------------------
 1 file changed, 154 deletions(-)
 delete mode 100644 Bankers.txt

diff --git a/Bankers.txt b/Bankers.txt
deleted file mode 100644
index 3b6da26..0000000
--- a/Bankers.txt
+++ /dev/null
@@ -1,154 +0,0 @@
-// C Program to implement Bankers Algorirthm
-
-#include <stdio.h>
-#include<conio.h>
- 
-int current[5][5], maximum_claim[5][5], available[5];
-int allocation[5] = {0, 0, 0, 0, 0};
-int maxres[5], running[5], safe = 0;
-int counter = 0, i, j, exec, resources, processes, k = 1;
-
-//Main Function Start 
-
-int main()
-{
-    printf("\nEnter number of processes: ");
-        scanf("%d", &processes);
- 
-        for (i = 0; i < processes; i++) 
-    {
-            running[i] = 1;
-            counter++;
-        }
- 
-        printf("\nEnter number of resources: ");
-        scanf("%d", &resources);
- 
-        printf("\nEnter Claim Vector:");
-        for (i = 0; i < resources; i++) 
-    { 
-            scanf("%d", &maxres[i]);
-        }
- 
-       printf("\nEnter Allocated Resource Table:\n");
-        for (i = 0; i < processes; i++) 
-    {
-            for(j = 0; j < resources; j++) 
-        {
-              scanf("%d", &current[i][j]);
-            }
-        }
- 
-        printf("\nEnter Maximum Claim Table:\n");
-        for (i = 0; i < processes; i++) 
-    {
-            for(j = 0; j < resources; j++) 
-        {
-                    scanf("%d", &maximum_claim[i][j]);
-            }
-        }
- 
-    printf("\nThe Claim Vector is: ");
-        for (i = 0; i < resources; i++) 
-    {
-            printf("\t%d", maxres[i]);
-    }
- 
-        printf("\nThe Allocated Resource Table:\n");
-        for (i = 0; i < processes; i++) 
-    {
-            for (j = 0; j < resources; j++) 
-        {
-                    printf("\t%d", current[i][j]);
-            }
-        printf("\n");
-        }
- 
-        printf("\nThe Maximum Claim Table:\n");
-        for (i = 0; i < processes; i++) 
-    {
-            for (j = 0; j < resources; j++) 
-        {
-                printf("\t%d", maximum_claim[i][j]);
-            }
-            printf("\n");
-        }
- 
-        for (i = 0; i < processes; i++) 
-    {
-            for (j = 0; j < resources; j++) 
-        {
-                    allocation[j] += current[i][j];
-            }
-        }
- 
-        printf("\nAllocated resources:");
-        for (i = 0; i < resources; i++) 
-    {
-            printf("\t%d", allocation[i]);
-        }
- 
-        for (i = 0; i < resources; i++) 
-    {
-            available[i] = maxres[i] - allocation[i];
-    }
- 
-        printf("\nAvailable resources:");
-        for (i = 0; i < resources; i++) 
-    {
-            printf("\t%d", available[i]);
-        }
-        printf("\n");
- 
-        while (counter != 0) 
-    {
-            safe = 0;
-            for (i = 0; i < processes; i++) 
-        {
-                    if (running[i]) 
-            {
-                        exec = 1;
-                        for (j = 0; j < resources; j++) 
-                {
-                                if (maximum_claim[i][j] - current[i][j] > available[j]) 
-                    {
-                                    exec = 0;
-                                    break;
-                                }
-                        }
-                        if (exec) 
-                {
-                                printf("\nProcess%d is executing\n", i + 1);
-                                running[i] = 0;
-                                counter--;
-                                safe = 1;
- 
-                                for (j = 0; j < resources; j++) 
-                    {
-                                    available[j] += current[i][j];
-                                }
-                            break;
-                        }
-                    }
-            }
-            if (!safe) 
-        {
-                    printf("\nThe processes are in unsafe state.\n");
-                    break;
-            } 
-        else 
-        {
-                    printf("\nThe process is in safe state");
-                    printf("\nAvailable vector:");
- 
-                    for (i = 0; i < resources; i++) 
-            {
-                        printf("\t%d", available[i]);
-                    }
- 
-                printf("\n");
-            }
-        }
-        return 0;
-
-} // END Of Program !!!