Time Left - 15:00 mins
CPU scheduling
Attempt now to get your rank among 405 students!
Question 1
Consider the following statements given below:
S1: Round Robin scheduling algorithm always give better performance compared to first come first serve scheduling algorithm.
S2 : An advantage of system call is to provide an interface between running program and operating system.
Which of the above statements is/are incorrect?
S1: Round Robin scheduling algorithm always give better performance compared to first come first serve scheduling algorithm.
S2 : An advantage of system call is to provide an interface between running program and operating system.
Which of the above statements is/are incorrect?
Question 2
Consider the following table of arrival time and burst time for these processes P0, P1 and P2.
The round robin scheduling algorithm with time quantum 3 is used as scheduling is carried out only at arrival or completion of processes what is the average waiting time for the 3 processes?
Question 3
In FCFS, CPU scheduling, When a process with a long CPU burst occupies the CPU, ______ is said to occur.
Question 4
Consider the following set of processes that need to be schedule on a single CPU. All the times are given in msec.
Which of the following will give minimum average waiting time for all five processes?
Question 5
Consider the following set of processes with the arrival times and burst times. Processes are scheduled using highest response ratio next.
(All time in milliseconds)
The average waiting time of processes are ________ (ms). (Upto 1 decimal place)
Question 6
Consider the following set of processes with the arrival time and CPU burst time. (Both are in msec)
Assume above processes are scheduled by RR scheduler with time quantum of 2 msec. The average waiting time of all processes is _________ msec. (Upto 2 decimal places)
- 405 attempts
- 2 upvotes
- 2 comments
Nov 2GATE & PSU CS
