Classification of Scheduling Algorithms

Embedded System

This set of Embedded Systems Multiple Choice Questions & Answers (MCQs) focuses on “Classification of Scheduling Algorithm”.

1. Which classification is based on the extension to standard operating systems?
a) software and hardware deadline
b) aperiodic deadline
c) periodic deadline
d) static and dynamic deadline

2. Which of the following defines the task which must be executed at every defined unit of time?
a) aperiodic task
b) periodic task
c) job
d) process

3. Which of the task are not periodic?
a) periodic task
b) unpredictable task
c) aperiodic task
d) job

4. Which of the following is an aperiodic task requesting the processor at unpredictable times?
a) job
b) aperiodic task
c) sporadic
d) periodic task

5. Which of the scheduling algorithm are based on the assumption that tasks are executed until they are done?
a) periodic task
b) aperiodic task
c) non-preemptive scheduling
d) preemptive scheduling

6. Which of the following schedulers take decisions at run-time?
a) preemptive scheduler
b) non preemptive scheduler
c) dynamic scheduler
d) static scheduler

7. Which scheduler takes their designs at design time?
a) preemptive scheduler
b) non preemptive scheduler
c) dynamic scheduler
d) static scheduler

8. Which scheduler generates tables and forward to the dispatcher?
a) static scheduler
b) dynamic scheduler
c) aperiodic scheduler
d) preemptive scheduler

9. Which of the following systems are entirely controlled by the timer?
a) voltage triggered
b) time triggered
c) aperiodic task scheduler
d) periodic task scheduler

10. What does TDL stand for?
a) task descriptor list
b) task design list
c) temporal descriptor list
d) temporal design list

11. Which scheduling algorithm can be used in mixed software/hardware systems?
a) simple algorithm
b) complex algorithm
c) uniprocessor algorithm
d) multiprocessor algorithm

12. Which algorithm can distinguish homogeneous multiprocessor system and heterogeneous multiprocessor system?
a) complex algorithm
b) simple algorithm
c) scheduler algorithm
d) preemptive algorithm

13. Which of the following scheduling test can be used to show that no scheduling exist?
a) sufficient test
b) necessary test
c) complex test
d) simple test

14. Which scheduling test is used to indicate that no scheduling exist even if there exist one?
a) complex test
b) simple test
c) sufficient test
d) necessary test

15. Which algorithm can be used to schedule tasks at run-time?
a) online scheduler
b) offline scheduler
c) multiprocessor scheduler
d) uniprocessor scheduler

Leave a Reply

Your email address will not be published. Required fields are marked *