#include<iostream>
#include <cmath>
using namespace std;
/*先来先服务调度算法*/
void FIFO(int b[],int n,int num)//b[]磁道请求序列,num磁头当前所在磁道号
{
int i=0,sum=0,x;
x=abs(b[i]-num);
cout<<"==================================================="<<endl;
cout<<"访问序号\t所访磁道\t移动距离"<<endl;
cou...
#include<iostream>
#include<string>
using namespace std;
struct CHCT;
struct COCT;
struct shebei{ //设备的模拟结构体
};
struct qudong{ //驱动程序模拟结构体
};
struct tongdao{ //通道队列结点结构体
int state;
tongdao *next; //队列指针
};
struct kongzhiqi{ /...