实验一进程及其管理进程调度算法模拟,用动态优先数及时间片轮转法实现进程调度.docVIP

#include stdio.h //界面 void menu(int arr[][5]) { int i,j; printf(********进程相关信息如下:***********\n); for(i =0;i5;i++) { switch(i) { case 0: printf(ID :);for(j=0;j5;j++)printf(%d ,arr[i][j]);printf(\n);break; case 1: printf(PRI :);for(j=0;j5;j++)printf(%d ,arr[i][j]);printf(\n);break; case 2: printf(CPUTIMEL:);for(j=0;j5;j++)printf(%d ,arr[i][j]);printf(\n);break; case 3: printf(NEADTIME:);for(j=0;j5;j++)printf(%d ,arr[i][j]);printf(\n);break; case 4: printf(STATE :);for(j=0;j5;j++)printf(%d ,arr[i][j]);printf(\n);break; } } printf(\n*************进程