GATE CSE 2016 Set 1 | Process Concepts and Cpu Scheduling Question 13 | Operating Systems

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-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?

Shortest remaining time first

Round-robin with time quantum less than the shortest $$CPU$$ burst

Uniform random

Highest priority first with priority proportional to $$CPU$$ burst length

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

-0.3

The maximum number of processes that can be in $$Ready$$ state for a computer system with $$n$$ $$CPUs$$ is

$$n$$

$${n^2}$$

$${2^n}$$

Independent of $$n$$

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is FALSE?

User level threads are not scheduled by the kernel.

When a user level thread is blocked, all other threads of its process are blocked.

Context switching between user level threads is faster than context switching between kernel level threads.

Kernel level threads cannot share the code segment.

GATE CSE 2013

MCQ (Single Correct Answer)

-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?

This algorithm is equivalent to the first-come-first-serve algorithm.

This algorithm is equivalent to the round-robin algorithm.

This algorithm is equivalent to the shortest-job-first algorithm.

This algorithm is equivalent to the shortest-remaining-time-first algorithm.

PREVIOUS NEXT