C语言实现银行家算法(待补充).doc

#include #include #include #include #define M 3 /资源种类m种#define N 4 /进程个数nint need103;/进程还需资源矩阵int max103;/进程最大需求矩阵int allocation103;/已分配资源矩阵 int available3; /可用资源向量int work3;/可用资源向量int finish10,finish110; /记录进程申请的资源是否能分配int path10=0,1,2,3,4,5,6,7,8,9;/记录安全序列int is_save;/是否产生安全序列int mark10; /记录某进程是否已分配资源void display(int *a,int n) /显示一维数组 int i; for(i=0;in;i+) printf(%3d,ai); void disp( ) /显示资源列表 int i; printf(Nnumbert Maxtt needtt allocationt avaliblen); for(i=0;iN;i+) printf(p%dt,i);/-分别显示P0,P1,P2的Max,Need,Allocation,Avalible display(maxi,M); printf(t); display(needi,M); printf(t); display(allocationi,M); printf(t); if(i=0) display(available,M); printf(n); void init( ) int i,j; srand(time(NULL); for(i=0;iM;i+) for(j=0;jN;j+) allocationij=rand()%10; needij=rand()%10; maxij=allocationij+needij; for(i=0;iN;i+) availablei=rand()%12;6 disp(); is_save=0;void showMenu( ) puts(n*); puts(*0.初始化数据 1.安全性算法 2.银行家算法 3.退出*); puts(*);int safe()/检查安全序列 int i,j,k=1; / k用来结束安全序列的查找 int flag=1; / flag = 0表示当前可用资源 进程申请资源数 int r=0,r1=0; / 记录所需资源能被满足的进程数； for( j = 0; j M; j+) /初始化work workj = availablej; printf(现在进行安全性检查.n); for( i = 0; i =4) printf(-找到安全序列-n);for(i=0;i,pathi); else printf(p%dn,pathi); return 1; else printf(进行安全性检查后.n); printf(当前状态不安全！n); return 0; void print_sav_seq()int i,j;printf(安全序列如下：);for( j = 0; j :);printf(p%d, pathj);puts();puts(*);puts(* Work Need Allocation Work+Allocation Finish *);puts(* A B C A B C A B C A B C *);for( j = 0; j M; j+)workj = availablej;for( j = 0; j %d;B-%d;C-%dnnn,available0, available1, available2 );void banker()int oper, i, j, flag1 = 0, flag2 = 0; /用来比较requestj needij 和requestj availablej int request3;while(1)flag1 = flag2 = 0;printf(请输入要操作的进程号：);scanf(%d, &i);if(iN|i0) printf(你输入的进程号不存在！); break;printf(请输入各类资源的请求数：);scanf(%d %d %d, &request0, &request1, &request2);/请在此处插入银行家算法实现的代码！puts( 1.继续操作 2.退出);scanf(%d, &oper);if(oper = 2)break;int main()int oper;while(1)showMenu();printf(请选择接下来的操作：);scanf(%d, &oper);switch( oper )case 0:init();break;case 1:if(safe()=1) is_save =1;if(is_save = 1)print_sav_seq();elseputs(无法找到安全