操作系統(tǒng)-銀行家算法實(shí)驗(yàn)C語言.doc

#includestdio.h#includestdlib.h#includestring.hint n,m;struct infoint claim50;int allocation50;int need50;pro50;int available50;int request50;void init() int i,j;printf(請輸入資源種類數(shù):);scanf(%d,&n); for(i=0;in;i+) printf(請輸入第%d個資源的最大資源數(shù):n,i);scanf(%d,&availablei); printf(請輸入進(jìn)程數(shù):);scanf(%d,&m);printf(請輸入各進(jìn)程對各資源的最大需求數(shù):n);for(i=0;im;i+) printf(請輸入第%d進(jìn)程對各資源的最大需求數(shù):n,i); for(j=0;jn;j+) scanf(%d,&proi.claimj); proi.allocationj=0; proi.needj=proi.claimj; printf(n);int safe() int work101; int finish101; int xulie101; int i,j,k,w=0; int flag=1,t=0; for(i=0;im;i+)finishi=0; for(i=0;in;i+)worki=availablei; for(i=0;im;i+) for(j=0;jm;j+)if(finishj=0)for(k=0;k=proj.needk)flag=1;else flag=0;if(flag=1)for(k=0;kn;k+)workk=workk+proj.allocationk;finishj=1;xuliew+=j;flag=1; for(i=0;im;i+)if(finishi=0) break;if(im)printf(系統(tǒng)是不安全的，進(jìn)程等待，請重新輸入進(jìn)程n);return 0;elseprintf(系統(tǒng)是安全的。n安全序列為 ：);for(i=0;i ,xuliei);printf(%dn,xuliem-1);return 1;void allo() int i,j; printf(請輸入申請資源的進(jìn)程號:n); scanf(%d,&i); printf(請輸入請求資源數(shù)量:n);for(j=0;jproi.needj) printf(進(jìn)程%d申請的資源數(shù)大于它所需要的%d類資源數(shù)，請重新輸入.n,i,j); j=j-1; continue; else if(requestjavailablej) printf(進(jìn)程%d申請的資源數(shù)大于剩余的%d類資源數(shù)，請重新輸入.n,i,j); j=j-1; continue; for(j=0;jn;j+)availablej=availablej-requestj;proi.allocationj=proi.allocationj+requestj;proi.needj=proi.needj-requestj;if(safe()=1)printf(請求分配成功！n);else printf(請求分配被拒絕！n);for(j=0;jn;j+)availablej=availablej+requestj;proi.allocationj=proi.allocationj-requestj;proi.needj=proi.needj+requestj;main() int i; in