PROCESS SCHEDULING

Experiment Number 1 : First Come First Serve



NUMERICALS
image           


PRACTICE NUMERICALS


Question 1
Consider the set of 5 processes whose arrival time and burst time are given below:

Q1

If the CPU scheduling policy is FCFS, calculate the average waiting time and average turn around time.
(a) 3.2 , 5.8
(b) 1.2 , 3.2
(c) 5.8 , 3.2
(d) 3.2 , 1.2

ANSWER:




Question 2
Consider the set of 3 processes whose arrival time and burst time are given below:

Q2

If the CPU scheduling policy is FCFS, calculate the average waiting time and average turn-around time
(a) 2 , 0
(b) 5 , 0
(c) 0 , 6
(d) 0 , 3

ANSWER:




Question 3
Consider the set of 6 processes whose arrival time and burst time are given below:

Q3

If the CPU scheduling policy is FCFS, calculate the average waiting time and average turn-around time.
(a) 4 , 3.2
(b) 6 , 5.23
(c) 4 , 6.83
(d) 2 , 6.33

ANSWER:




Question 4
Consider the following set of four processes. Their arrival time and burst time are given in the following table. Consider all time values in milliseconds. Calculate average turn around time and average waiting time.

Q4

(a) 7.25ms , 14.25ms
(b) 14.25ms , 8.75ms
(c) 6ms , 12.69ms
(d) 8.25ms , 19.23ms

ANSWER:




Question 5
Consider the following processes. Calculate average waiting time.
Q5

(a) 22/5
(b) 19/5
(c) 31/5
(d) 26/5

ANSWER: