Rate Monotonic Scheduling (RMS) – Real-time Systems MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. Rate Monotonic Scheduling (RMS) is based on which task parameter? (A) Deadline (B) Period (C) Execution time (D) Response time 2. In RMS, a task with a shorter period is assigned: (A) Lower priority (B) Equal priority (C) Dynamic priority (D) Higher priority 3. What type of priority does RMS use? (A) Dynamic (B) Random (C) Hybrid (D) Fixed 4. RMS is optimal under which condition? (A) Tasks are aperiodic (B) Tasks share resources heavily (C) Deadlines are arbitrary (D) Tasks are periodic and independent 5. In RMS, task deadlines are assumed to be: (A) Less than period (B) Greater than period (C) Unrelated to period (D) Equal to period 6. What happens if CPU utilization exceeds the RMS bound? (A) Task set always fails (B) Task set may or may not be schedulable (C) Task set is unschedulable (D) Task set always succeeds 7. The RMS utilization bound for n tasks is: (A) n(2¹⁄ⁿ − 1) (B) 1 − (1/n) (C) ln(n) (D) n/2 8. As the number of tasks increases, the RMS utilization bound approaches: (A) ln(2) (B) 0.5 (C) 1 (D) 0.75 9. RMS assigns priorities: (A) At design time (B) Dynamically (C) Randomly (D) At runtime 10. Which scheduling algorithm is preemptive by nature? (A) FCFS (B) RMS (C) Round Robin (D) Batch scheduling 11. Which task will get the highest priority in RMS? (A) Task with longest execution time (B) Task with earliest deadline (C) Task with largest period (D) Task with smallest period 12. RMS is best suited for: (A) Aperiodic tasks (B) Sporadic tasks (C) Periodic real-time tasks (D) Background tasks 13. What is the main advantage of RMS? (A) Low overhead (B) Optimal dynamic scheduling (C) Maximum CPU utilization (D) Simplicity and predictability 14. Which assumption is TRUE for RMS? (A) Tasks share deadlines (B) Tasks have variable periods (C) Tasks are independent (D) Tasks are non-preemptive 15. Which scheduling algorithm assigns higher priority to tasks with shorter periods? (A) EDF (B) LLF (C) RMS (D) FCFS 16. RMS is NOT suitable for: (A) Aperiodic tasks (B) Independent tasks (C) Tasks with deadlines equal to periods (D) Periodic tasks 17. RMS belongs to which class of scheduling? (A) Non-preemptive scheduling (B) Dynamic priority scheduling (C) Fixed priority scheduling (D) Fair scheduling 18. Which condition must be satisfied for RMS schedulability test? (A) Total utilization ≤ RMS bound (B) All tasks must be aperiodic (C) Deadlines > periods (D) Execution time = period 19. Compared to EDF, RMS is: (A) More optimal (B) Less optimal in CPU utilization (C) Equal in performance (D) Dynamic in priority 20. Which statement about RMS is TRUE? (A) Uses dynamic deadlines (B) Priorities remain fixed (C) Priorities change during execution (D) Always achieves 100% CPU utilization Related Posts:Deadline Monotonic Scheduling - Real-time Systems MCQsMetrics (open rate, click-through rate) MCQs in digital marketingShortest Job First Scheduling SJF Process Scheduling in operating systemsLeast Laxity First Scheduling - Real-time Systems MCQsFixed vs Dynamic Priority Scheduling - Real-time Systems MCQsCyclic Executive Scheduling - Real-time Systems MCQs
