Question

Jim is excited because he has just been delivered a new computer but he has a dilemma. It
seems that the Operating System Scheduling works a little differently compared to what he
has seen before. He finds that he cannot force the computer to switch tasks and tasks that
were given to the computer earlier are being executed after tasks that were submitted at a
later time (Il).
He now has the task of figuring out the time at which a batch of tasks will be completed
given their submit times and runtime durations
Note: If 2 tasks are submitted at the same time, the one encountered earlier in the
input array is executed first.

Answer 1

Answer:

First Come First Serve (FCFS): Simplest scheduling algorithm that schedules according to arrival times of processes. First come first serve scheduling algorithm states that the process that requests the CPU first is allocated the CPU first. It is implemented by using the FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. FCFS is a non-preemptive scheduling algorithm.

Explanation:

Plz mark it as the brainliest