수다닷컴

#includestdio.h
#includestdlib.h
typedef struct process{
char name[20]; //프로세스 이름
int arrive; //도착시간
int turnaround;
int waiting;
int running; //실행시간
int run;
int processNo;

};
struct process tmp;
int n=0;
int total=0;
int total2=0;
int quantum;
struct process *list;
struct process *queue;
void Menu()
{
printf(Main Menu\n);
printf(1) View Process information\n);
printf(2) First Come First Service (FCFS)\n);
printf(3) Shortest Job First (SJF)\n);
printf(4) Shortest Remaining Job First (SRT)\n);
printf(5) Round Robin (RR)\n);
printf(6) Exit\n);
}
void sort(process* queue=(process*)malloc(sizeof(process)*n)){
int a, b;
for (a=0; an-1; a++)
for (b=a+1; bn; b++)
if (queue[a].arrive queue[b].arrive){
tmp=queue[a];
queue[a]=queue[b];
queue[b]=tmp;
}
}
void View_Process_information()
{
int i=0;
FILE *fp=fopen(Process.txt,rt);

while(in)
{
fscanf(fp,%s\t%d\t%d,list[i].name, list[i].running, list[i].arrive);
printf(%s\t%d\t%d\n,list[i].name, list[i].running, list[i].arrive);
i++;
}
fclose(fp);

}
void tt(int pc)
{
int i;
for (i=0; ipc; i++)
total+=list[i].running;
total2=total;
}

void func_print(process* queue=(process*)malloc(sizeof(process)*n), int* gantt=(int*)malloc(sizeof(int)*total)){
int i=0, turnaround=0, waiting=0;
for (i=0,turnaround=0,waiting=0; in; i++){
turnaround+=queue[i].turnaround;
waiting+=queue[i].waiting;
}
printf(\n 1. Gantt Chart\n);
printf ( );
for (i=0; itotal; i++)
printf (%d,gantt[i]);
printf(\n 2. Average turnaround time : %d/%d = %f, turnaround,n,(float)turnaround/n);
printf(\n 3. Average waiting time : %d/%d = %f, waiting,n,(float)waiting/n);
printf(\n\n);
turnaround=0;
waiting=0;
total=total2;
free(gantt);
}//Function print

void FCFS(process* queue=(process*)malloc(sizeof(process)*n)){//FCFS
int* gantt=(int*)malloc(sizeof(int)*total);
int a, i=0;
for (i=0; in; i++)
queue[i]=list[i];
sort(queue);
i=0;
for (a=0; an; a++){
while ( queue[a].running 0 ){
gantt[i]=queue[a].processNo;
queue[a].running--;
i++;
queue[a].turnaround = i-queue[a].arrive;
queue[a].waiting = queue[a].turnaround - queue[a].run;
}
}
func_print(queue,gantt);
}

void SJF(process* queue=(process*)malloc(sizeof(process)*n)){//SJF
int* gantt=(int*)malloc(sizeof(int)*total);
int b, i=0, a=0;

for (i=0; in; i++)
queue[i]=list[i];
sort(queue);
i=0;
while (an){
while ( queue[a].running 0 ){
gantt[i]=queue[a].processNo;
queue[a].running--;
i++;
queue[a].turnaround = i-queue[a].arrive;
queue[a].waiting = queue[a].turnaround - queue[a].run;
}
a++;
for (b=a+1; bn; b++)
if (queue[b].arrive = i && queue[a].running queue[b].running){
tmp=queue[b];
queue[b]=queue[a];
queue[a]=tmp;
}
}
func_print(queue,gantt);
}

void SRT(process* queue=(process*)malloc(sizeof(process)*n)){//SRT
int* gantt=(int*)malloc(sizeof(int)*total);
int b, i=0, a=0;

for (i=0; in; i++)
queue[i]=list[i];
sort(queue);
i=0;

while (an){
while ( queue[a].running 0 ){
for (b=a+1; bn; b++)
if (queue[b].arrive = i && queue[a].running queue[b].running){
tmp=queue[b];
queue[b]=queue[a];
queue[a]=tmp;
} // 현재 도착한 프로세스중 실행시간이 짧을경우 실행되고 있는 프로세스와 교체
gantt[i]=queue[a].processNo;
queue[a].running--;
i++;
queue[a].turnaround = i-queue[a].arrive;
queue[a].waiting = queue[a].turnaround - queue[a].run;
}
a++;
}
func_print(queue,gantt);

}

void RR(process* queue=(process*)malloc(sizeof(process)*n)){//RR
int* gantt=(int*)malloc(sizeof(int)*total);
int b, a =0, i=0;
int next=0;
int quantum = 0;
printf(quantum 입력: );
scanf(%d,&quantum);
for (i=0; in; i++)
queue[i]=list[i];
sort(queue);

i =0;

while (itotal){
a = next%n;
if ( queue[a].arrive = i){
for (b=0; bquantum && queue[a].running0; b++){
gantt[i]=queue[a].processNo;
queue[a].running--;
i++;
queue[a].turnaround = i-queue[a].arrive;
queue[a].waiting = queue[a].turnaround - queue[a].run;
}
}

next++;
}
func_print(queue,gantt);
}

void Scheduler_Selection()
{
int number;
tt(n);
scanf(%d,&number);
// 선택한 scheduling Algorithmlgorithms 함수를 호출한다.
switch(number)
{
case 1: View_Process_information();
break;
case 2: FCFS(queue);
break;
case 3: SJF(queue);
break;
case 4: SRT(queue);
break;
case 5: RR(queue);
break;
case 6: exit(1);
break;
}
Menu();
Scheduler_Selection();
}

void main(){
int i;
FILE *Pit=fopen(Process.txt,wt);
printf(Process 개수 입력: );
scanf(%d,&n);
struct process * list=(struct process*)malloc(sizeof(struct process)*n);
struct process * queue=(struct process*)malloc(sizeof(struct process)*n);
printf(Process_name, CPU_time, Arrival_time 입력: \n);
for (i=0; in; i++){
list[i].processNo=i+1;
scanf(%s %d %d,&list[i].name,&list[i].running, &list[i].arrive);
fprintf(Pit,%s\t%d\t%d\n,list[i].name, list[i].running, list[i].arrive);
list[i].run = list[i].running;
}
Menu();
Scheduler_Selection();

fclose(Pit);
}

원래 c++소스인데 c로 돌리려고하니 에러가 뜹니다. 왜 에러뜨나요?

신청하기