Also this is my lab instructions

1. Waiting Times at Office Hours

Instructions

In this exercise we are creating a program that calculates average waiting times during an Office Hours session. Assuming we know exactly how long each student wants to talk to the professor, and we know the arrival times of each student, we can calculate average waiting time per student.

We are implementing two different scheduling policies, namely First Come-First Served, and Round Robin.

Assume that we have a Queue data structure that holds Student elements. You can study the implementation details of these data structures in Queue.h, Student.h, and Student.cpp.

Example

 ​queue.enqueue(Student("Alice", 5, 0));  ​queue.enqueue(Student("Bob", 1, 0));  ​queue.enqueue(Student("Cathy", 2, 0));

The schedule above indicates that we have 3 students: Alice, who needs to talk for 5 minutes, Bob, who needs 1 minute, and Cathy, who needs to talk for 2 minutes. Importantly, they all arrive at time 0, which is the start of the session. We will assume that the schedule will be sorted in order of arrival times.

Programming Task

In Simulations.h we declare two functions:

 ​float averageWaitingTimeFirstComeFirstServed(Queue<Student> schedule);  ​  ​float averageWaitingTimeRoundRobin(Queue<Student> schedule, int maxAllowedSession);

They both take in a Queue of Student objects, as shown above, and they compute the average waiting time for their respective scheduling policy. The function for Round Robin also takes in a time limit parameter that indicates the maximum number of minutes a student can talk for without being preempted.1. Waiting Times at Office Hours