31. Which scheduling algorithm is an optimal scheduling policy for the mono-processor system?
A. preemptive algorithm
B. LST
C. EDD
D. LL
Answer: D
The least laxity algorithm is a dynamic scheduling algorithm and hence it can be implemented as an optimal scheduling policy for the mono-processor system. The LL scheduling algorithm is also preemptive scheduling.
32. Which scheduling algorithm cannot be used with a standard OS providing fixed priorities?
A. LL
B. LST
C. EDD
D. EFD
Answer: A
The least laxity algorithm cannot be used with a standard OS providing fixed priorities because of its dynamic property.
33. Who proposed the LDF algorithm?
A. Bayes
B. Nyquist
C. Lawler
D. Stankovic
Answer: C
The latest deadline first or LDF is proposed by Lawler which performs a topological sort. It is based on the total order compatible with the partial order with respect to the task graph.
34. What does LDF stand for?
A. last deadline first
B. least deadline first
C. list deadline first
D. latest deadline first
Answer: D
The LDF or latest deadline first is a scheduling algorithm which is proposed by Lawler.
35. 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.
36. 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.
37. 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.
38. 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.
39. 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.
40. 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.
