文档介绍：: .
南昌大学实验报告
---(3)编程实现银行家安全算法
学生姓名：张虹学号：6100");printf("进程ABCABCABCABC\n");line();
for(n=0;n<5;n++)
printf("P%d%9d%3d%3d%5d%3d%3d%6d%3d%3d",n,max[n][0],max[n][1],max[n][2],allocation[n][0],allocation[n][1],allocation[n][2],need[n][0],need[n][1],need[n][2]);if(n==0)printf("%6d%3d%3d\n",available[0],available[1],available[2]);
elseprintf("\n");
line();voidchange()//当Request[i,j]<=Available[j]时，系统把资源分配给进程P[i]，Available[j]和Need[i,j]发生改变
for(m=0;m<3;m++)available[m]-=request[i][m];allocation[i][m]+=request[i][m];need[i][m]-=request[i][m];voidoutputsafe()//输出安全序列的资源分配表
printf("该安全序列的资源分配图如下：\n");
line();
printf("资源情况WorkNeedAllocationWork+AllocationFinish\n");printf("进程ABCABCABCABC\n");line();
for(n=0;n<5;n++)
printf("P%d%9d%3d%3d%5d%3d%3d%5d%3d%3d%6d%3d%3d%12s\n",safe[n],works[safe[n]][0],works[safe[n]][1],works[safe[n]][2],need[safe[n]][0],need[safe[n]][1],need[safe[n]][2],allocation[safe[n]][0],allocation[safe[n]][1],allocation[safe[n]][2],works[safe[n]][0]+allocation[safe[n]][0],works[safe[n]][1]+allocation[safe[n]][1],works[safe[n]][2]+allocation[safe[n]][2],finish[n]);
line();intcheck()//安全性算法
printf(”开始执行安全性算法……\n");
for(m=0;m<3;m++)//数组work和finish初始化work[m]=available[m];
for(n=0;n<5;n++)finish[n]="false";safe[n]=0;
k=0;
for(m=0;m<5;m++)for(n=0;n<5;n++)
if(strcmp(finish[n],"false")==0&&