Thank you for uploading the image. The document contains scheduling problems related to process management in operating systems. Here’s a breakdown of the tasks:

Exercise 3 (FIFO Scheduling)

We are given 5 processes (A, B, C, D, E) with their respective arrival times and execution times. We need to:

1. Draw the Gantt Chart for the FIFO (First In First Out) scheduling algorithm.
2. Calculate the turnaround time (temps de séjour) for each process and the average turnaround time.
3. Calculate the waiting time (temps d'attente) for each process and the average waiting time.

Data:

Exercise 4 (SJF Scheduling)

We are given 5 processes (P1, P2, P3, P4, P5) with their arrival times and service times. Tasks:

1. Explain the principle of the Shortest Job First (SJF) scheduling algorithm.
2. Draw the Gantt Chart for the SJF scheduling algorithm.
3. Calculate the turnaround time for each process and the average turnaround time.
4. Calculate the waiting time for each process and the average waiting time.

Data:

Would you like me to solve Exercise 3, Exercise 4, or both? Let me know!