Scribd
Upload
7 views1 page

Assignment 1 Process

The document outlines an assignment involving process scheduling algorithms including Shortest-Job-First, Priority, and Round-Robin. It requires students to create Gantt charts, calculate turnaround and waiting times for various sets of processes, and analyze the average times for each scheduling method. Additionally, it includes scenarios with batch jobs and considers process swapping overhead in the calculations.

Uploaded by

Hetal Vasava
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views1 page

Assignment 1 Process

The document outlines an assignment involving process scheduling algorithms including Shortest-Job-First, Priority, and Round-Robin. It requires students to create Gantt charts, calculate turnaround and waiting times for various sets of processes, and analyze the average times for each scheduling method. Additionally, it includes scenarios with batch jobs and considers process swapping overhead in the calculations.

Uploaded by

Hetal Vasava
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Assignment 1

1. Consider the following scenario of processes.

For each of the scheduling algorithms, Shortest-Job-First (SJF, non-preemptive), Priority (Preemptive)
(smaller priority number implies higher scheduling priority), and RR (quantum = 2) do the following:
a. Draw a Gantt chart to show how these processes would be scheduled.
b. Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed)
and the waiting time (total time spent in the Ready state) of each process.
c. Give the average waiting time and average turnaround time of all the processes.

2. Consider the following set of processes with the length of the CPU burst given in milliseconds:

a.) Draw Gantt charts that illustrate the execution of these processes using the following scheduling
algorithms: Non Preemptive SJF, SRTN, Priority (Preemptive, non-preemptive) (a smaller number implies
a higher priority), RR (quantum = 2)
b.) What is the turnaround time and Waiting time of each process for each of the scheduling algorithms
in part a?
c.) What is the average turnaround time and waiting time of each process for each of the scheduling
algorithms in part a?

3. Five batch jobs A, B, C, D and E arrive at same time. They have estimated running times 10, 6, 3, 4 and 8
ms. For each of the following algorithm determine mean process turnaround time. Consider process
swapping overhead is 1 ms.
1) FCFS
2) Round-Robin (Time quantum = 2 ms)

4. Five batch jobs P1, P2, P3, P4 and P5 arrive at 0, 1, 2, 3 and 4 ms. They have estimated running times 14,
12, 8, 3 and 6 ms. Their priorities are 3, 5, 2, 1 and 4 respectively with 5 being highest priority. For each
of the following algorithm determine mean process turnaround time. Consider process swapping
overhead is 0.5 ms.
1) SJF (Non-preemptive)
2) Priority Scheduling (Preemptive)

You might also like