1. (20 pts) Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority

P1 2 3
P2 1 1
P3 8 5
P4 4 2
P5 5 4
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Use a software to draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, nonpreemptive SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2), and calculate the average waiting time for each algorithm. Any software is fine. Hand drawing is not accepted.

  1. [programming question] (80 pts) Welcome to Flight School. Any employees or students can take one-to- one flight lessons taught by one of instructors.

Use C and POSIX threads, mutex locks, and semaphores to implement a solution that coordinates the activities of instructors and the students. Details for this assignment are provided below.

Sample Solution

This question has been answered.

Get Answer