1
GATE CSE 2016 Set 1
+1
-0.3
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?
A
Shortest remaining time first
B
Round-robin with time quantum less than the shortest $$CPU$$ burst
C
Uniform random
D
Highest priority first with priority proportional to $$CPU$$ burst length
2
GATE CSE 2015 Set 3
+1
-0.3
The maximum number of processes that can be in $$Ready$$ state for a computer system with $$n$$ $$CPUs$$ is
A
$$n$$
B
$${n^2}$$
C
$${2^n}$$
D
Independent of $$n$$
3
GATE CSE 2014 Set 1
+1
-0.3
Which one of the following is FALSE?
A
User level threads are not scheduled by the kernel.
B
When a user level thread is blocked, all other threads of its process are blocked.
C
Context switching between user level threads is faster than context switching between kernel level threads.
D
Kernel level threads cannot share the code segment.
4
GATE CSE 2013
+1
-0.3
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every $$T$$ time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no $${\rm I}/O$$ operations and all arrive at time zero?
A
This algorithm is equivalent to the first-come-first-serve algorithm.
B
This algorithm is equivalent to the round-robin algorithm.
C
This algorithm is equivalent to the shortest-job-first algorithm.
D
This algorithm is equivalent to the shortest-remaining-time-first algorithm.
GATE CSE Subjects
EXAM MAP
Medical
NEET