GATE CSE 2011 | Process Concepts and Cpu Scheduling Question 34 | Operating Systems

GATE CSE 2011

MCQ (Single Correct Answer)

-0.3

Let the time taken to switch between user and kernel modes of execution be $${t_1}$$ while the time taken to switch between two processes be $${t_2}$$.

Which of the following is TRUE?

$${t_1} > {t_2}$$

$${t_1} = {t_2}$$

$${t_1} < {t_2}$$

Nothing can be said about the relation between $${t_1}$$ and $${t_2}.$$

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

Which of the following statements are true?
$${\rm I}.$$ Shortest remaining time first scheduling may cause starvation
$${\rm II}.$$ Preemptive scheduling may cause starvation
$${\rm III}.$$ Round robin is better than $$FCFS$$ in terms of response time

$${\rm I}$$ only

$${\rm I}$$ and $${\rm II}$$ only

$${\rm II}$$ and $${\rm III}$$ only

$${\rm I},$$ $${\rm II}$$ and $${\rm III}$$

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

A CPU generally handles an interrupt by executing an interrupt service routine

As soon as an interrupt is raised

By checking the interrupt register at the end of fetch cycle.

By checking the interrupt register after finishing the execution of the current instruction.

By checking the interrupt register at fixed time intervals.

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Group-1 contains some $$CPU$$ scheduling algorithms and Group-2 contains some applications. Match entries in Group-1 to entries in Group-2.

Group-1
(P) Gang Scheduling
(Q) Rate Monotonic Scheduling
(R) Fair Share Scheduling

Group-2
(1) Guaranteed Scheduling
(2) Real-time Scheduling
(3) Thread Scheduling

$$P - 3,Q - 2,R - 1$$

$$P - 1,Q - 2,R - 3$$

$$P - 2,Q - 3,R - 1$$

$$P - 1,Q - 3,R - 2$$

PREVIOUS NEXT