read all the question. this a simple c programming, you are going to perform the CPU scheduling for processes using various algorithms and draw the Gantt chart for these algorithms and compute the average waiting time and completion time all in c code.

Algorithms to use:

1- First-come, first served (FCFS).

2- Round-robin (RR).

3- Rate-monotonic.

4- Earliest-deadline first scheduling.

for all the algorithms, you need to consider:

Process arrival time should be computed based on Poissons distribution with user will enter the lambda value

Burst time should be a random value within the specified interval of user choice.

For RR:

Burst time should be a random value within the specified interval of user choice

.Quanta time should also be taken from the user

For Rate-monotonic scheduling and Earliest-Deadline first scheduling:

Period should be taken from user

In addition, for rate-monotonic and earliest-deadline first scheduling, you need to check whether the processes can be scheduled or not. If, not then you have to clearly specify that.The grading will be as follows:

Correct formulation of Poisson arrival for processes

Display of Gantt chart for each process.

Computation of average wait time and completion time for each process

Checking whether process is admissible or not for RTOS