Question

Assuming FCFS and round robin scheduling algorithms, construct an example job mix with at least three jobs, such that all jobs have the same completion times. Your example should precisely state the arrival times of each job, their lengths, and the duration of the time slice for the round robin scheduler. Assume that the context switch overhead is zero

Answer 1

The example is pretty simple actually. You can design infinite no. of such examples which will follow these set of conditions. See what you just need to do is enter a new process into the system when one of the processes of the system is finished.

For eg.:-

Process Id	Arrival Time	Burst Time
P0	0	5
P1	5	7
P2	12	10

These three processes will have the same completion time with both the scheduling algorithms.

Hope this helps. If you like the answer please upvote. If you have any queries or suggestions regarding the answers please leave them in the comments section so I can update and improve the answer. Thank you.