Question

1. Consider the following jobs having I/0 wait of 70% with Arrival time and CPU minutes needed.

Jobs Arrival Time CPU minutes needed 13:10 8 2 13:30 6 3 13:40 4 4 13:50 4 5 13:55 3

Draw a graph showing no. of jobs and when it completes.

Answer 1

In the given task set of the jobs given, the arrival time of all the jobs is given with respect to the 13.XX.

Hence, we can make the graph of job scheduling with an arrival time as 10, 30, 40, 50, and 55 (with respect to 13).

Here, the jobs are scheduling on the first come first serve basis as the default scheduling algorithm in the General Operating system is FCFS.

The graph showing no. of jobs and when it completes is given below :

Blank 2 3 4 1 5. 0 10 18 30 36 40 44 50 54 55 58