Deadline Monotonic Scheduling – Real-time Systems MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. Deadline Monotonic Scheduling (DMS) assigns priorities based on: (A) Task period (B) Task deadline (C) Execution time (D) Task arrival time 2. In DMS, the task with the shortest relative deadline is given: (A) Lowest priority (B) Highest priority (C) Dynamic priority (D) Equal priority 3. DMS is a type of: (A) Dynamic-priority scheduling (B) Fixed-priority scheduling (C) Round-robin scheduling (D) Non-preemptive scheduling 4. DMS is optimal when: (A) Tasks share resources (B) Tasks are sporadic (C) Deadlines are greater than periods (D) Tasks are independent and deadlines ≤ periods 5. How does DMS differ from RMS? (A) DMS is dynamic, RMS is fixed (B) DMS assigns priority by deadline, RMS by period (C) DMS ignores deadlines, RMS uses deadlines (D) Both are identical 6. DMS is MOST suitable for: (A) Soft real-time tasks (B) Hard real-time tasks with deadlines ≤ periods (C) Aperiodic tasks (D) Background tasks 7. Which is TRUE about DMS priorities? (A) They are fixed at runtime (B) They are dynamic (C) They change randomly (D) They are always lowest for earliest deadlines 8. What happens if a task misses its deadline in DMS? (A) Hard real-time violation may occur (B) Task executes later without issues (C) CPU utilization improves (D) Task priority increases 9. Which parameter is critical for DMS schedulability? (A) Disk speed (B) CPU temperature (C) Memory size (D) Worst-case execution time 10. DMS is guaranteed to be optimal under: (A) Deadlines greater than periods (B) Deadlines equal to periods (C) Aperiodic tasks (D) Random arrivals 11. Which task will have the highest priority in DMS? (A) Task with largest period (B) Task with shortest relative deadline (C) Task with longest execution time (D) Task with latest release time 12. DMS is a variant of which scheduling algorithm? (A) Earliest Deadline First (EDF) (B) Rate Monotonic Scheduling (RMS) (C) First Come First Served (FCFS) (D) Round Robin 13. Which condition must hold for DMS to guarantee all deadlines? (A) Tasks are aperiodic (B) Total CPU utilization ≤ DMS bound (C) Deadlines ignored (D) Execution time is infinite 14. DMS assumes tasks are: (A) Dependent and share resources (B) Event-driven only (C) Non-preemptive (D) Independent and preemptive 15. Compared to EDF, DMS uses: (A) Dynamic priorities (B) Fixed priorities (C) Random priorities (D) No priorities 16. Which system can use DMS effectively? (A) Multimedia playback (B) Flight control system (C) Office automation (D) Batch processing 17. DMS is also called: (A) Earliest task first (B) Rate-monotonic variant with deadlines ≤ periods (C) Aperiodic scheduling (D) Background scheduling 18. Which statement about DMS is TRUE? (A) Priorities are dynamic (B) Deadline misses are acceptable (C) Task periods are ignored (D) Priorities are fixed according to deadlines 19. DMS guarantees all deadlines if: (A) CPU utilization ≤ 1 and deadlines ≤ periods (B) CPU utilization > 1 (C) Deadlines are arbitrary (D) Tasks are aperiodic 20. DMS scheduling is mainly used in: (A) Hard real-time systems (B) General-purpose systems (C) Soft real-time systems (D) Non-preemptive systems Related Posts:Rate Monotonic Scheduling (RMS) - Real-time Systems MCQsEarliest Deadline First (EDF) - Real-time Systems MCQsTask Parameters (Period, Deadline, WCET) - Real-time Systems MCQsShortest Job First Scheduling SJF Process Scheduling in operating systemsLeast Laxity First Scheduling - Real-time Systems MCQsFixed vs Dynamic Priority Scheduling - Real-time Systems MCQs
