file.cpp

操作系统中的进程调度算法

#include<stdio.h>
#include<stdlib.h>
#define SIZE 10
#define OVERFLOW 0
#define OK 1
int id,al,pr;
float in;
struct data{
  int ID;
  int Priority;
  float IN;
  int Alltime;
}data[SIZE];
typedef struct QNode{
  int ID;
  int Priority;
  int State;
  float IN;
  int Alltime;
  struct QNode * next;
}QNode,*QueuePtr;
typedef struct{
  QueuePtr front;
  QueuePtr rear;
}LinkQueue;
LinkQueue Q;
QueuePtr p,q;
EnQueue(LinkQueue &Q,int i);
void  file(){
  int size,i=0;
  FILE *fp;
  printf("Please input the data:ID,Priority,IN,Alltime\n");
  printf("(The form of IN is *0**,if the ID=0,end)\n");
  scanf("%d%d%d%d",&data[i].ID,&data[i].Priority,&data[i].IN,&data[i].Alltime);
  while(data[i].ID!=0)
    { i++;
      scanf("%d%d%d%d",&data[i].ID,&data[i].Priority,&data[i].IN,&data[i].Alltime);
    }
  size=i;
  if((fp=fopen("c:\\pc.txt","w+"))==NULL)
     { printf("cannot open this file\n");
       return;
     }
  for(i=0;i<size;i++)
    fwrite(&data[i],sizeof(struct data),1,fp);
      for(i=0;i<size;i++)
     { fread(&data[i],sizeof(struct data),1,fp);
	  EnQueue(Q,i);
     }
}
LinkQueue InitQueue(LinkQueue &Q){
  Q.front=Q.rear=(QueuePtr)malloc(sizeof (QNode));
  if(!Q.front)
    exit(OVERFLOW);
  Q.front->next=NULL;
  return Q;
}
EnQueue(LinkQueue &Q,int i){
  p=(QueuePtr)malloc(sizeof (QNode));
  if(!p)
    exit(OVERFLOW);
  p->ID=data[i].ID; p->Priority=data[i].Priority; p->IN=data[i].IN; p->Alltime=data[i].Alltime;
  p->next=NULL;
  Q.rear->next=p;
  Q.rear=p;
  return OK;
}