1. Earliest Deadline First (EDF) scheduling assigns priority based on:
(A) Task period
(B) Absolute deadline
(C) Arrival time
(D) Execution time
2. In EDF, which task gets the highest priority?
(A) Task with longest execution time
(B) Task with earliest deadline
(C) Task with lowest period
(D) Task with highest priority number
3. EDF belongs to which class of scheduling algorithms?
(A) Dynamic priority
(B) Non-preemptive
(C) Fixed priority
(D) Cyclic
4. EDF is optimal for scheduling:
(A) Aperiodic tasks only
(B) Non-preemptive tasks
(C) Dependent tasks
(D) Periodic independent tasks
5. In EDF, priorities are:
(A) Assigned at design time
(B) Fixed throughout execution
(C) Random
(D) Assigned at runtime
6. Which condition ensures EDF schedulability on a single processor?
(A) Tasks are non-preemptive
(B) Total utilization ≤ RMS bound
(C) Deadlines = periods
(D) Total utilization ≤ 1
7. Compared to RMS, EDF can achieve:
(A) Lower CPU utilization
(B) Higher CPU utilization
(C) Same utilization always
(D) No utilization guarantee
8. EDF scheduling decisions are made based on:
(A) Period
(B) Deadline
(C) Execution time
(D) Task ID
9. Which of the following is a disadvantage of EDF?
(A) Simple implementation
(B) Fixed priorities
(C) Low overhead
(D) High runtime overhead
10. EDF is MOST suitable for:
(A) Batch systems
(B) Periodic real-time systems
(C) General-purpose systems
(D) Background tasks
11. What happens in EDF when a new task with an earlier deadline arrives?
(A) It waits until CPU is free
(B) It is rejected
(C) It preempts the running task
(D) It is delayed
12. EDF priorities depend on:
(A) Absolute deadlines
(B) Task period only
(C) Relative deadlines
(D) Execution time only
13. Which scheduling algorithm uses earliest deadline as priority?
(A) EDF
(B) FCFS
(C) Round Robin
(D) RMS
14. EDF can schedule tasks successfully if:
(A) Tasks are sporadic
(B) Utilization ≤ 1
(C) Utilization exceeds 1
(D) Deadlines are ignored
15. EDF differs from RMS because EDF:
(A) Uses dynamic deadlines
(B) Uses static scheduling
(C) Uses fixed priorities
(D) Assigns priority by period
16. Which system benefits MOST from EDF?
(A) Batch system
(B) Soft real-time system
(C) Non-real-time system
(D) Hard real-time system
17. In EDF, task priorities:
(A) Change dynamically
(B) Never change
(C) Are assigned randomly
(D) Are fixed
18. EDF is NOT optimal for:
(A) Single processor systems
(B) Preemptive scheduling
(C) Multiprocessor systems
(D) Independent tasks
19. Which EDF property ensures no missed deadlines if feasible?
(A) Fairness
(B) Optimality
(C) Simplicity
(D) Determinism
20. Which statement about EDF is TRUE?
(A) It uses fixed priorities
(B) It has lower overhead than RMS
(C) It assigns priority based on task period
(D) It guarantees schedulability if utilization ≤ 1