Aperiodic Scheduling MCQ Quiz – Objective Question with Answer for Aperiodic Scheduling

21. Which of the following can be applied to periodic scheduling?

A. EDF
B. LL
C. LST
D. EDD

Answer: A

The earliest deadline first can be applied both to the periodic and aperiodic scheduling algorithm. But LL, LST, and EDD are aperiodic scheduling. It is not applicable to periodic scheduling.

 

22. Which of the following periodic scheduling is dynamic?

A. RMS
B. EDF
C. LST
D. LL

Answer: B

The EDF or the earliest deadline first is a periodic scheduling algorithm that is dynamic but RMS or rate monotonic scheduling is the periodic algorithm that is static. The LL and LST are aperiodic scheduling algorithms.

 

23. Which of the following do the sporadic events are connected?

A. Interrupts
B. NMI
C. Software interrupt
D. Timer

Answer: A

The sporadic events are connected to the interrupts thereby executing them immediately as possible since the interrupt priority is the highest in the system.

 

24. Which of the following can execute quickly, if the interrupt priority is higher in the system?

A. EDD
B. Sporadic event
C. LL
D. Aperiodic scheduling

Answer: B

The sporadic events are connected to the interrupts and executed them immediately because the interrupt priority is the highest priority level in the system.

 

25. Which of the following are used to execute at regular intervals and check for ready sporadic tasks?

A. sporadic task server
B. sporadic task client
C. sporadic event application
D. sporadic register

Answer: A

The special sporadic task servers are used that execute at regular intervals and check for ready sporadic tasks which improve the predictability of the whole system.

 

26. How is a sporadic task can turn into a periodic task?

A. scheduling algorithm
B. sporadic task event
C. sporadic register
D. sporadic task server

Answer: D

The special sporadic task servers execute at regular intervals and check for ready sporadic tasks and by this, sporadic tasks are essentially turned into periodic tasks which can improve the predictability of the whole system.

 

27. Which of the following is more difficult than the scheduling independent task?

A. scheduling algorithm
B. scheduling independent task
C. scheduling dependent task
D. aperiodic scheduling algorithm

Answer: C

The scheduling-dependent task is more difficult than the independent scheduling task. The problem of deciding whether or not a schedule exists for a given set of dependent tasks and a given deadline is NP-complete.

 

28. Which scheduling is the basis for a number of formal proofs of schedulability?

A. LL
B. RMS
C. LST
D. EDD

Answer: B

The rate monotonic scheduling which is an independent scheduling algorithm form the basis for a number of formal proofs of schedulability.

 

29. Which of the following is independent scheduling?

A. LL
B. LST
C. EDD
D. RMS

Answer: D

The RMS or rate monotonic scheduling is the independent scheduling algorithm that is included in the assumptions of RMS, that is, all tasks should be independent.

Scroll to Top