11. 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
Answer: B
The periodic task is the one that must be executed in a defined unit of time say ‘p’ where p is called the period.
12. Which of the task are not periodic?
A. periodic task
B. unpredictable task
C. aperiodic task
D. job
Answer: C
The aperiodic task is the one in which the task is not periodic but the periodic task is the one in which are the task is periodic. Each execution of a periodic task is known as the job.
13. Which of the following is an aperiodic task requesting the processor at unpredictable times?
A. job
B. aperiodic task
C. sporadic
D. periodic task
Answer: C
The aperiodic tasks request the processor at unpredictable times if and only if there is a minimum separation between the times at which they request the processor which is called sporadic.
14. 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
Answer: C
The non-preemptive scheduling is based on the assumption that the tasks are executed until the task is done whereas the preemptive scheduling is used if the task has long execution times or for a short response time.
15. Which of the following schedulers take decisions at run-time?
A. preemptive scheduler
B. non-preemptive scheduler
C. dynamic scheduler
D. static scheduler
Answer: C
The dynamic schedulers take decisions at run-time and they are quite flexible but generate overhead at run-time whereas static scheduler is the ones in which the scheduler take their designs at the design time.
16. Which scheduler takes their designs at design time?
A. preemptive scheduler
B. non-preemptive scheduler
C. dynamic scheduler
D. static scheduler
Answer: D
The static scheduler takes their designs at the design time and it also generates tables of start times which are forwarded to a simple dispatcher but the dynamic scheduler takes a decision at the run-time.
17. Which scheduler generates tables and forward to the dispatcher?
A. static scheduler
B. dynamic scheduler
C. aperiodic scheduler
D. preemptive scheduler
Answer: A
The static scheduler generates tables of start times which are forwarded to a simple dispatcher and it can be controlled by a timer that makes the dispatcher analyze the table.
18. 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
Answer: B
The systems which are entirely controlled by a timer are known as entirely time-triggered systems. A temporal control structure is associated with the entirely time-triggered system which is encoded in a TDL, task descriptor list.
19. What does TDL stand for?
A. task descriptor list
B. task design list
C. temporal descriptor list
D. temporal design list
Answer: A
TDL is a task descriptor list that contains the cyclic schedule for all activities of the node and the temporal control structure is encoded by the task descriptor table.
20. Which scheduling algorithm can be used in mixed software/hardware systems?
A. simple algorithm
B. complex algorithm
C. uniprocessor algorithm
D. multiprocessor algorithm
Answer: B
The complex algorithm is used in mixed software/hardware systems. It can be used to handle multiple processors.
