0% found this document useful (0 votes)
12 views3 pages

864 itleAssignMaster 264 02272025025146818

The document outlines an assignment due on 28/2/2025, focusing on various scheduling algorithms in operating systems. It includes tasks for First-Come-First-Serve, Shortest Job First, Shortest Remaining Time First, Priority Scheduling, and Round Robin Scheduling, each requiring the calculation of Gantt charts, completion times, turnaround times, and waiting times. Each section provides a set of processes with their arrival and burst times for analysis.

Uploaded by

231501080
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
0% found this document useful (0 votes)
12 views3 pages

864 itleAssignMaster 264 02272025025146818

The document outlines an assignment due on 28/2/2025, focusing on various scheduling algorithms in operating systems. It includes tasks for First-Come-First-Serve, Shortest Job First, Shortest Remaining Time First, Priority Scheduling, and Round Robin Scheduling, each requiring the calculation of Gantt charts, completion times, turnaround times, and waiting times. Each section provides a set of processes with their arrival and burst times for analysis.

Uploaded by

231501080
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
You are on page 1/ 3

Assignment 2 - Last Date to submit: 28/2/2025

First-Come-First-Serve (FCFS) Scheduling

Question:
Consider the following set of processes with their arrival time and burst time:

Arrival Burst
Process
Time Time

P1 0 5

P2 2 3

P3 4 2

P4 6 4

Find the Gantt chart, completion time, turnaround time, and waiting time for each process.
Also, calculate the average turnaround time and average waiting time.

Shortest Job First (SJF) - Non-Preemptive


Question:
Consider the following set of processes:

Arrival Burst
Process
Time Time

P1 1 6

P2 2 8

P3 3 7

P4 4 3

Find the Gantt chart, completion time, turnaround time, waiting time, and average times.
Shortest Remaining Time First (SRTF) - Preemptive
Question:
Consider the following processes:

Process Arrival Time Burst Time

P1 0 8

P2 1 4

P3 2 9

P4 3 5

Find the Gantt chart, completion time, turnaround time, and waiting time for each process.

Priority Scheduling (Non-Preemptive)


Question:
Consider the following processes with priority values (lower number = higher priority):

Process Arrival Time Burst Time Priority

P1 0 10 3

P2 1 1 1

P3 2 2 4

P4 3 1 2

Find the Gantt chart, completion time, turnaround time, waiting time, and average times.
Round Robin Scheduling (Time Quantum = 3)
Question:
Consider the following processes:

Arrival
Process Burst Time
Time

P1 0 10

P2 2 4

P3 3 5

P4 5 7

Using Round Robin scheduling with a time quantum of 3, find the Gantt chart, completion
time, turnaround time, and waiting time for each process.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy