11. Which algorithm is non-preemptive and can be used with a mono processor?
A. LDF
B. pre-emptive
C. aperiodic
D. LL
Answer: A
The latest deadline first or LDF is a non-preemptive scheduling algorithm and can be used with a mono processor whereas LL or least laxity is a preemptive scheduling algorithm.
12. Which algorithm requires the periodic checks of the laxity?
A. LST
B. LL
C. EDD
D. EFD
Answer: B
The LL scheduling algorithm requires the knowledge of the execution times and the periodic check of the laxity.
13. Who developed the heuristic algorithm?
A. Stankovic and Ramamritham
B. Stankovic and Lawler
C. Lawler
D. Stankovic
Answer: A
The heuristic algorithm is developed by Stankovic and Ramamritham in 1991.
14. Which algorithm can be used if the preemptive is not allowed?
A. heuristic algorithm
B. LL
C. EDD
D. LST
Answer: A
The heuristic algorithm proposed by Stankovic and Ramamritham in 1991 can be used if the preemption is not allowed.
15. Deadline interval – execution time =
A. laxity
B. execution time
C. deadline interval
D. period
Answer: A
The laxity is defined as the deadline interval minus the execution time. It is also known as the slack.
1. The execution of the task is known as
A. process
B. job
C. task
D. thread
Answer: B
The execution of the task is known as the job. The time for both the execution of the task and the corresponding job is the same.
16. Which scheduling algorithm is can be used for an independent periodic process?
A. EDD
B. LL
C. LST
D. RMS
Answer: D
The RMS os rate monotonic scheduling is a periodic scheduling algorithm but EDD, LL, and LST are aperiodic scheduling algorithms.
17. What is the relationship between the priority of tasks and their period in RMS?
A. decreases
B. increases
C. remains unchanged
D. linear
Answer: A
The priority of the task decreases monotonically with respect to their period in the rate of monotonic scheduling, that is, the task with a long period will get a low priority but the task with a short period will get a high priority.
18. Which of the following uses a preemptive periodic scheduling algorithm?
A. Pre-emptive scheduling
B. RMS
C. LL
D. LST
Answer: B
The rate monotonic scheduling is a periodic scheduler algorithm that follows a preemptive algorithm. LL is also preemptive scheduling but it is an aperiodic scheduling algorithm.
19. Which of the following is based on static priorities?
A. Periodic EDF
B. RMS
C. LL
D. Aperiodic EDF
Answer: B
The rate monotonic scheduling is a periodic scheduler algorithm that follows a preemptive algorithm and has static priorities. EDF and LL have dynamic priorities.
20. How many assumptions have to meet for a rate of monotonic scheduling?
A. 3
B. 4
C. 5
D. 6
Answer: D
The rate of monotonic scheduling has to meet six assumptions. These are: All the tasks should be periodic, all the tasks must be independent, the deadline should be equal to the period for all tasks, the execution time must be constant, the time required for the context switching must be negligible, it should hold the accumulation utilization equation.
