操作系统实验包括(处理机调度,页面置换,驱动调度,银行家).docVIP

#include iostream #includestring.h #includestdio.h #include math.h #include〈stdlib.h〉 #include time.h #define False 0 #define True 1 #define L 20//贝面走向长度最大力20 define MAX 100 using namespace std; int Ma41001[100]={0};//各进程所需各类资源的最人需求 int Avaliable[ 100]={0};//系统可用资源 char name 1100]={0};//资源的名称 int Allocation[100][100]={0};//系统己分 源 int Need[100][100]={0};//还需要资源 int Request[ 100]={0};//请求资源向量 int temp[100]={0};//存放安全序列 int Work[ 100]={0};//存放系统可提供资源 int M=100;//进程的最大数为 int N=l()0;//资源的最大数为 int M emory; /人J 存块 struct Pro//定义一个结构体(页面置换) { int num，time; //处理器调度部分代码 struct pcb { char name[20]; pcb* next; int arrivetime，runtime; char state; //状态 int priority; //优先级 pcb(){ next = NULL;) }; enum Kind { .EMPTY, _FCFS, _ROUNDROBIN, .PRIORITY}; class process pcb* head; int number; Kind kind; public: process(); //清空进程序列? //清空进程序列 void InputProcess(); void RunProcessQ; //输入进程序列 //运行进程序列 //先来先服务算法 //先来先服务算法 void RoundRobin(int time = 1); //按时间片轮转法 void Priority(int time = 1); //优先级调度算法 process: :process() head = NULL; number = 0; kind = 一EMPTY; } process::?process() { Clear(); void process::Clear() { pcb* pi, *p2; for(pl = head; pi; pi = p2) { p2 = pl-next; delete pi; } head = NULL; number = 0; kind = —EMPTY; void process: :InputProcess() { if(head != NULL) Clear(); int k; cout? n?endl; cout? 1:先来先服*n?endl; cout?2:时间片轮转endl; COUt?n3：优先级调度《611(11; cout? ?endl; cout?请选择：; cin ? k; switch(k) { case 1: kind = _FCFS; break; case 2: kind = _ROUNDROBIN; break; case 3: kind = _PRIORITY; break; emit《”输入进程数：”； cin ? number; peb* rear, *p; for(int i = 0; i number; i++) { p = new peb; if(kind == .PRIORITY) { C0Ut? 输入第”《1+1 ?”个进程名、到达时间、运行时间和优先级 cin ? p-〉name ? p-arrivetime ? p-runtime ? p-〉priority; } else { 00讲输入第|’1+1’*个进程名、到达时间和运行时间：”； cin ? p-name ? p-arrivetime ? p-runtime; } if(head == NULL) head = rear = p; } else rear-next = p;rear = p; void process::RunProcess() { switch(kind) { case _FCFS: FCFS(); break; case _ROUNDROBIN: RoundRobin(); break; case _PRIORITY: PriorityO; break; defau