Time Left - 15:00 mins
GATE CS 2021 : Operating System Quiz 3
Attempt now to get your rank among 715 students!
Question 1
Match the following groups
Group-I
A) FCFS
B) Round Robin
C) SRTF
D) Priority scheduler
Group-II
1. Important processes get execute first.
2. Minimize the average waiting time
3. The processes run in the order they arrived.
4. Every process get a chance to execute.
Group-I
A) FCFS
B) Round Robin
C) SRTF
D) Priority scheduler
Group-II
1. Important processes get execute first.
2. Minimize the average waiting time
3. The processes run in the order they arrived.
4. Every process get a chance to execute.
Question 2
Consider the following 3 processes with the length of cpu burst time(in milliseconds). All processes arriving at the same time in order P1, P2, P3
If Round Robin Scheduling is used with time quantum of 1 Unit then average waiting time will be,
If Round Robin Scheduling is used with time quantum of 1 Unit then average waiting time will be,
Question 3
Consider the following for CPU scheduling: 
Case 1: Preemptive Shortest Job First Scheduling
Case 2: Non-preemptive Shortest Job First Scheduling
What is the difference between the average turn-around time found in case-2 and case -1?
Question 4
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining time first.
The average turnaround time of these processes is _____ milliseconds.
The average turnaround time of these processes is _____ milliseconds.
Question 5
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Question 6
Consider the following set of processes 
What is the waiting time for process P3 if round robin scheduling with time quantum 5ms is used?
- 715 attempts
- 3 upvotes
- 30 comments
Aug 29GATE & PSU CS
