C++； 我尝试在C++中实现FCFS CPU调度。我有下面的代码，它运行时没有错误，但在一些数字上给了我“垃圾数据”，例如除第一个计算的进程之外的所有进程的等待时间、响应时间和周转时间的值 #include "stdafx.h" #include <iostream> #include <string> using namespace std; class ProcessInfo { public: string ProcessID; int BurstTime; int Arrival; int WaitingTime; int ResponseTime; int TurnaroundTime; }; int main() { ProcessInfo P1, P2, P3 = ProcessInfo(); ProcessInfo Array[3] = {P1, P2, P3}; for(int i = 0; i < 3; i++) { cout<<"Please enter Process ID for process "<<i<<endl; cin>>Array[i].ProcessID; cout<<"Please enter Burst Time for process "<<i<<endl; cin>>Array[i].BurstTime; cout<<"Please enter Arrival Time for process "<<i<<endl; cin>>Array[i].Arrival; } if (Array[0].Arrival < Array[1].Arrival && Array[0].Arrival < Array[2].Arrival) { if (Array[1].Arrival < Array[2].Arrival) { P1.WaitingTime = 0; P1.ResponseTime = 0; P1.TurnaroundTime = P1.BurstTime; P2.WaitingTime = P1.TurnaroundTime - (P2.Arrival - P1.Arrival); P2.ResponseTime = 0; P2.TurnaroundTime = P2.WaitingTime + P2.BurstTime; P3.WaitingTime = P2.TurnaroundTime - (P3.Arrival - P2.Arrival); P3.ResponseTime = P2.TurnaroundTime - (P3.Arrival - P2.Arrival) ; P3.TurnaroundTime = P3.WaitingTime + P3.BurstTime; cout<<"Order of processes is: P1, P2, P3"<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; } else if (Array[2].Arrival < Array[1].Arrival) { P1.WaitingTime = 0; P1.ResponseTime = 0; P1.TurnaroundTime = P1.BurstTime; P3.WaitingTime = P1.TurnaroundTime - (P3.Arrival - P1.Arrival); P3.ResponseTime = P3.WaitingTime; P3.TurnaroundTime = P3.WaitingTime + P3.BurstTime; P2.WaitingTime = P3.TurnaroundTime - (P2.Arrival - P3.Arrival); P2.ResponseTime = P2.WaitingTime; P2.TurnaroundTime = P2.WaitingTime + P2.BurstTime; cout<<"Order of processes is: P1, P3, P2"<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; } } else if(Array[1].Arrival < Array[0].Arrival && Array[1].Arrival < Array[2].Arrival) { if (Array[2].Arrival < Array[0].Arrival) { P2.WaitingTime = 0; P2.ResponseTime = 0; P2.TurnaroundTime = P2.BurstTime; P3.WaitingTime = P2.TurnaroundTime - (P3.Arrival - P2.Arrival); P3.ResponseTime = P3.WaitingTime; P3.TurnaroundTime = P3.WaitingTime + P3.BurstTime; P1.WaitingTime = P3.TurnaroundTime - (P1.Arrival - P3.Arrival); P1.ResponseTime = P1.WaitingTime; P1.TurnaroundTime = P1.WaitingTime + P1.BurstTime; cout<<"Order of processes is: P2, P3, P1"<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; } else if (Array[0].Arrival < Array[2].Arrival) { P2.WaitingTime = 0; P2.ResponseTime = 0; P2.TurnaroundTime = P2.BurstTime; P1.WaitingTime = P2.TurnaroundTime - (P1.Arrival - P2.Arrival); P1.ResponseTime = P1.WaitingTime; P1.TurnaroundTime = P1.WaitingTime + P1.BurstTime; P3.WaitingTime = P1.TurnaroundTime - (P3.Arrival - P1.Arrival); P3.ResponseTime = P3.WaitingTime; P3.TurnaroundTime = P3.WaitingTime + P3.BurstTime; cout<<"Order of processes is: P2, P1, P3"<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; } } else if(Array[2].Arrival < Array[1].Arrival && Array[2].Arrival < Array[0].Arrival) { if (Array[1].Arrival < Array[0].Arrival) { P3.WaitingTime = 0; P3.ResponseTime = 0; P3.TurnaroundTime = P1.BurstTime; P2.WaitingTime = P3.TurnaroundTime - (P2.Arrival - P3.Arrival); P2.ResponseTime = P2.WaitingTime; P2.TurnaroundTime = P2.WaitingTime + P2.BurstTime; P1.WaitingTime = P2.TurnaroundTime - (P1.Arrival - P2.Arrival); P1.ResponseTime = P1.WaitingTime; P1.TurnaroundTime = P1.WaitingTime + P1.BurstTime; cout<<"Order of processes is: P3, P2, P1"<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; } else if (Array[0].Arrival < Array[1].Arrival) { P3.WaitingTime = 0; P3.ResponseTime = 0; P3.TurnaroundTime = P1.BurstTime; P1.WaitingTime = P3.TurnaroundTime - (P1.Arrival - P3.Arrival); P1.ResponseTime = P1.WaitingTime; P1.TurnaroundTime = P1.WaitingTime + P1.BurstTime; P2.WaitingTime = P1.TurnaroundTime - (P2.Arrival - P1.Arrival); P2.ResponseTime = P2.WaitingTime; P2.TurnaroundTime = P2.WaitingTime + P2.BurstTime; cout<<"Order of processes is: P3, P1, P2"<<endl; cout<<"The waiting time for P3: "<< P3.WaitingTime<<endl; cout<<"The response time for P3: "<<P3.ResponseTime<<endl; cout<<"The Turnaround time for P3: "<<P3.TurnaroundTime<<endl; cout<<"The waiting time for P1: "<< P1.WaitingTime<<endl; cout<<"The response time for P1: "<<P1.ResponseTime<<endl; cout<<"The Turnaround time for P1: "<<P1.TurnaroundTime<<endl; cout<<"The waiting time for P2: "<< P2.WaitingTime<<endl; cout<<"The response time for P2: "<<P2.ResponseTime<<endl; cout<<"The Turnaround time for P2: "<<P2.TurnaroundTime<<endl; } } } #包括“stdafx.h” #包括 #包括 使用名称空间std； 类ProcessInfo { 公众： 字符串ProcessID； int突发时间； 国际到达； 国际等待时间； int响应时间； 周转时间； }; int main（） { ProcessInfo P1、P2、P3=ProcessInfo（）； ProcessInfo数组[3]={P1，P2，P3}； 对于（int i=0；i

您不初始化变量

P1

和

P2

，因此这些结构的内容将是未定义的

这将使操作像

P1.TurnaroundTime = P1.BurstTime;

也未定义

---

如果您想要良好的开始值，请添加默认构造函数。

不要使用

P1

、

P2

和

P3

进行计算。而是使用

Array[0]

、

Array[1]

和

Array[2]

进行计算。

包括
#include<iostream>

#include<cstdio>

#include<cstdlib>

int process,*q,i,slice,a=0,at2[10],to[10];

void takeprocess()

{

    printf("Enter the total number of process\n");

    scanf("%d",&process);


}


void takecputime()

{

    q=(int*)calloc(process,(sizeof(int)));

for(i=1;i<=process;i++)

{

printf("Enter the CPU burst time for the process P%d : ",i);

   scanf("%d",q+i);

   to[i]=at2[i]=*(q+i);

}

}

void checkfcfs()

{
 int wt1[process];

    for(i=1;i<process;i++)

    {

        a=wt1[i]=*(q+i)+a;

    }

    a=0;

    printf("the waiting time for process P1 is : 0\n");

    for(i=1;i<process;i++)

    {

   a=wt1[i]+a;

        printf("the waiting time for process P%d is : %d\n",i+1,wt1[i]);
    }

    a=a/process;

    printf("the average waiting time for processes are :%d\n",a);

    printf("the sequence of the processes are as follows\n");

    for(i=1;i<=process;i++)

    {

        printf("P%d\n",i);

    }


}

using namespace std;

int main()

{

             takeprocess();

             takecputime();

             checkfcfs();

             return 0;


}

#包括
#包括
int进程，*q，i，slice，a=0，at2[10]到[10]；
无效进程（）
{
printf（“输入进程总数\n”）；
scanf（“%d”和进程）；
}
void takecputime（）
{
q=（int*）calloc（进程）（sizeof（int））；
对于（i=1；iI）添加了以下默认构造函数类ProcessInfo{public:string ProcessID；int BurstTime；int Arrival；int WaitingTime；int ResponseTime；int TournalTime；ProcessInfo（）{ProcessID=“”；BurstTime=0；Arrival=0；WaitingTime=0；ResponseTime=0；TournalTime=0；}；现在它给了我零分values@Scorps您可能希望在调试器中逐行遍历代码，以查看它执行您想要的操作并设置您想要的值。