TUTORIAL MENGIMPLEMENTASIKAN ALGORITMA BANKER DEADLOK SISTEM OPERASI DENGAN PEMROGRAMAN C/C++

-luntas ilmu- ini saya akan share tutorial dari algoritma banker untuk penanganan deadlock di sistem operasi. Sebenanya ini tugas matkul Sistem Operasi sih :D namun setelah saya pusing ngerjakan dan bingung udah ketemu algoritmanya langsung saja ane share supaya teman semua tidak merasakan kebingungan seperti saya. ini saya tulis dengan bahasa c bisa juga anda tulis dengan bahasa apapun selain c

	/*PROGRAM TO IMPLEMENT BANKER'S ALGORITHM
	* --------------------------------------------*/
	#include <stdio.h>
	int curr[5][5], maxclaim[5][5], avl[5];
	int alloc[5] = {0,0,0,0,0};
	int maxres[5], running[5], safe=0;
	int count = 0, i, j, exec, r, p,k=1;

	int main()
	{
	printf("\nEnter the number of processes: ");
	scanf("%d",&p);

	for(i=0;i<p;i++)
	{
	running[i]=1;
	count++;
	}

	printf("\nEnter the number of resources: ");
	scanf("%d",&r);

	for(i=0;i<r;i++)
	{
	printf("\nEnter the resource for instance %d: ",k++);
	scanf("%d",&maxres[i]);
	}

	printf("\nEnter maximum resource table:\n");
	for(i=0;i<p;i++)
	{
	for(j=0;j<r;j++)
	{
	scanf("%d",&maxclaim[i][j]);
	}
	}

	printf("\nEnter allocated resource table:\n");
	for(i=0;i<p;i++)
	{
	for(j=0;j<r;j++)
	{
	scanf("%d",&curr[i][j]);
	}
	}

	printf("\nThe resource of instances: ");
	for(i=0;i<r;i++)
	{
	printf("\t%d",maxres[i]);
	}

	printf("\nThe allocated resource table:\n");
	for(i=0;i<p;i++)
	{
	for(j=0;j<r;j++)
	{
	printf("\t%d",curr[i][j]);
	}

	printf("\n");
	}

	printf("\nThe maximum resource table:\n");
	for(i=0;i<p;i++)
	{
	for(j=0;j<r;j++)
	{
	printf("\t%d",maxclaim[i][j]);
	}

	printf("\n");
	}

	for(i=0;i<p;i++)
	{
	for(j=0;j<r;j++)
	{
	alloc[j]+=curr[i][j];
	}
	}

	printf("\nAllocated resources:");
	for(i=0;i<r;i++)
	{
	printf("\t%d",alloc[i]);
	}

	for(i=0;i<r;i++)
	{
	avl[i]=maxres[i]-alloc[i];
	}

	printf("\nAvailable resources:");
	for(i=0;i<r;i++)
	{
	printf("\t%d",avl[i]);
	}
	printf("\n");

	//Main procedure goes below to check for unsafe state.
	while(count!=0)
	{
	safe=0;
	for(i=0;i<p;i++)
	{
	if(running[i])
	{
	exec=1;
	for(j=0;j<r;j++)
	{
	if(maxclaim[i][j] - curr[i][j] > avl[j]){
	exec=0;
	break;
	}
	}
	if(exec)
	{
	printf("\nProcess%d is executing\n",i+1);
	running[i]=0;
	count--;
	safe=1;

	for(j=0;j<r;j++) {
	avl[j]+=curr[i][j];
	}

	break;
	}
	}
	}
	if(!safe)
	{
	printf("\nThe processes are in unsafe state.\n");
	break;
	}
	else
	{
	printf("\nThe process is in safe state");
	printf("\nSafe sequence is:");

	for(i=0;i<r;i++)
	{
	printf("\t%d",avl[i]);
	}

	printf("\n");
	}
	}
	}