Earliest deadline first algorithm assigns priorities according to ___ – McqOptions

MCQOPTIONS

1.	Earliest deadline first algorithm assigns priorities according to ____________
A.	a) periods
B.	b) deadlines
C.	burst times
D.	none of the mentioned
Answer» C. burst times

Discussion

No Comment Found

Related MCQs

State whether the following statements are True or False for the features of real time operating system.i) fast process or thread switchii) ability to respond to external interrupts quickly.iii) minimization of intervals during which interrupts are enabled.iv) preemptive scheduling based on priority
In which scheduling certain amount of CPU time is allocated to each process ?
In on-line scheduling, scheduler make the schedule ……………………... that will be released in future.
LRT schedules all the job backward from …………………... of all the job in priority driven manner to the current time.
Effective deadline of job with successor is equal tothe minimum value among its deadlines and …………………………
Effective release time of a job with predecessors is equal to the maximum value among, its…………and…………..
Effective deadline of job without the successor is equal to its given ……………
Effective release time of a job without the predecessors is equal to its given …………….
State whether the following statements are True or False for the features of real time operating system.i) fast process or thread switch ii) ability to respond to external interrupts quickly. iii) minimization of intervals during which interrupts are enabled. iv) preemptive scheduling based on priority
What is True for a task vis-à-vis a process?