ITPEC FE Morning October 2018 Question 18
ITPEC FE Morning October 2018 — Question 18 of 80
Priority-Based Preemptive Scheduling — select the correct usage of this scheduling method in embedded RTOS.
Priority-based preemptive scheduling processes tasks by importance and urgency. A higher-priority task can interrupt (preempt) a running lower-priority task at any time.
Why not others:
- (a) Evenly assigning execution time — describes Round Robin scheduling
- (c) Sequentially from earlier arriving times — describes FCFS (First Come, First Served)
- (d) Sequentially from shorter processing times — describes SJF (Shortest Job First)
Key rule: In real-time OS, priority-based preemptive scheduling ensures critical tasks always get CPU time immediately.
AI-generated — may contain errors
The original exam layout is preserved in the image so diagrams, formulas, tables, and code remain accurate.
This question comes from an official ITPEC past paper. ITPEC Practice is an independent study tool and is not affiliated with ITPEC. See the official FE past-paper collection or Report an issue.