操作系统实验三-银行家算法.docx

Available = Available - Request

Allocation[i]= Allocation[i]+ Request

Work = work + Allocation[i]

//***********************************************************************//

//* *//

//* Available_list.txt *//

//* *//

//* *//

//* Max_list.txt *//

//* 2 2 2 *//

//* 4 3 3 *//

//* 3 0 2 *//

//* 2 1 1 *//

//* 0 0 2 *//

//* *//

//* *//

//*************************************************************************//

#include <iostream.h>

#include <stdio.h>

#include <windows.h>

FILE *fp;

if((fp=fopen("Available_list.txt","r"))==NULL)

}

int i=0;

while(!feof(fp))

{

fscanf(fp,"%d",&Available[i]);

i++;

}

fclose(fp);

}

void Read_Max_list()

{

FILE *fp;

if((fp=fopen("Max_list.txt","r"))==NULL)

{

exit(0);

}

fscanf(fp,"%d",&PROCESS_NUM);

}

FILE *fp;