Scribd
Upload
5 views2 pages

Scheduling Algorithms Question Bank

The document contains a question bank focused on scheduling criteria and algorithms in operating systems. It includes tasks to calculate average waiting and turnaround times using various scheduling methods such as FCFS, SRTF, RR, and priority scheduling, along with examples of processes and their attributes. Additionally, it discusses multiple-processor scheduling and provides a specific problem for calculating times using the FCFS algorithm.

Uploaded by

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

Scheduling Algorithms Question Bank

The document contains a question bank focused on scheduling criteria and algorithms in operating systems. It includes tasks to calculate average waiting and turnaround times using various scheduling methods such as FCFS, SRTF, RR, and priority scheduling, along with examples of processes and their attributes. Additionally, it discusses multiple-processor scheduling and provides a specific problem for calculating times using the FCFS algorithm.

Uploaded by

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

Module 2 Question Bank

1. Explain Scheduling Criteria

2. Calculate the average Waiting time and average turnaround time by


drawing Gantt Chart using FCFS, SRTF, RR(q=2ms) and priority
algorithms. Lower priority number represents the higher priority

Process Arrival Time Burst Time Priority


P1 0 9 3
P2 1 4 2
P3 2 9 1
P4 3 5 4

3. Calculate average waiting and turnaround times by drawing the


Gantt
chart using FCFS and RR (q=2ms).

Process Arrival Time Burst Time


P1 0 9
P2 1 4
P3 2 9
P4 3 5

4. Calculate the average waiting time and the average turnaround


time by drawing the Gantt chart using SRTF and the Priority
scheduling algorithm.

Process Arrival Time Burst Time Priority


P1 0 8 3
P2 1 4 2
P3 2 9 1
P4 3 5 4
5. Explain in detail about Multiple -processor scheduling with example
6. Consider the following set of four process with length of CPU burst
given in ms

Process Burst Time


P1 24
P2 3
P3 3
Compute the average waiting time and average turnaround time for
the above process using FCFS algorithm

You might also like