Consider the following set of jobs.

Job Number	1	2	3	4	5	6
Arrival Time	0	1	4	7	17	18
Service Time	6	2	4	2	4	2

Clearly show the scheduling of these jobs using the following algorithms (refer to the notes).

1. First-in-first-out (fifo, fcfs)
2. Shortest job first
3. Shortest remaining time first
4. Round-robin (time quantum = 1)

Also, for each scheduling algorithm, compute (i) Average turnaround time, and (ii) Average (response time / service time).

then

------

Consider a system that runs the following periodic jobs. Compute the system throughput.

Job number	1	2	3	4
Service time	2 sec	1 sec	2 sec	1.5 sec
Period the job has to run repeatedly	10 sec	6 sec	12 sec	9 sec