For FCFS and SJF algorithms study them and develop them using C programming language in a Linux environment.

Consider the following data for FCFS and SJF

Process	Arrival Time	Burst Time
P1	0	14
P2	0	6
P3	0	12
P4	0	17
P5	0	4

• The description of the scheduling algorithms
• Flowchart of Program
• Code
• output
• Evaluation of above two scheduling algorithms using Gantt chart, Calculate Turnaround time and Waiting time for each process and also calculate Average Turnaround time & Average Waiting time.
• Finally comparison of both scheduling algorithm

Answer rating: 100% (QA)

Lets first implement the FCFS FirstCome FirstServed and SJF Shortest Job First scheduling algorithms ... View the full answer