1. Given the following arrival time and CPU cycle times.

Job	Arrival Time	CPU Cycles Required
A	0	10
B	2	12
C	3	3
D	6	1
E	9	15

a) Draw a timeline for each of the following scheduling algorithms and show the details of the ready queue formation during the timeline. Ignore context switching and natural wait time during the calculation and demonstration. ((3+2)X4 =20 Marks)

i. FCFS

ii. SJN

iii. SRT

iv. Round Robin (use time quantum of 4)

b) Using either internet resources or books, understand the concept of waiting time and turnaround time. Define those terms (waiting time and turnaround time) in your own words. Then calculate waiting time and turnaround time for every job for all four scheduling algorithms mentioned in Q5-a (Details of the calculations is essential). (8Marks)

Thank You Please,