Realtime Operating System » Cpu Scheduling 1
Earliest deadline first algorithm assigns priorities according to ____________

A. Periods
B. Deadlines
C. Burst times
D. None of the mentioned

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., the priorities of P1 and P2 are?

A. Remain the same throughout
B. Keep varying from time to time
C. May or may not be change
D. None of the mentioned

Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to __________

A. The cost of context switching
B. Interrupt handling
C. Power consumption
D. All of the mentioned

T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

A. Rate monotonic
B. Proportional share
C. Earliest deadline first
D. None of the mentioned