31. Which of the following determines the next task in the time slice method of task swapping?
A. scheduling program
B. scheduling application
C. scheduling algorithm
D. scheduling task
Answer: C
The time slice mechanism can also be used as a scheduling method in which the task to run next is determined by the scheduling algorithm.
32. Which of the following can be used to distribute the time slice across all the tasks?
A. timer
B. counter
C. round-robin
D. task slicing
Answer: C
The time slice-based system uses a fairness scheduler or round-robin to distribute the time slices across all the tasks that need to run in a particular time slot.
33. What do a time slice period plus a context switch time of the processor determines?
A. scheduling task
B. scheduling algorithm
C. context task
D. context switch time
Answer: D
The context switch time of the processor along with the time slice period determines the context switch time of the system which is an important factor in system response, that is, the time period can be reduced to improve the context switching of the system which will increase the number of task switches.
34. Which can increase the number of task switches?
A. time period
B. frequency
C. time rate
D. number of cycles
Answer: A
The time period can be reduced to improve the context switching of the system which will increase the number of task switches.
35. Which mechanism is used behind Windows 3.1?
A. time slice
B. pre-emption
C. cooperative multitasking
D. scheduling algorithm
Answer: C
The cooperative multitasking mechanism has used Windows 3.1 but it does not apply to real-time operating systems.
36. Which of the following provides an illusion of multitasking?
A. the single-task operating system
B. multitasking operating system
C. cooperative multitasking
D. pre-emption
Answer: C
Cooperative multitasking co-operates between them which provides the illusion of multitasking. This is done by periodically executing the tasks.
37. Which task method follows a currently running task to be stopped by a higher priority task?
A. scheduling algorithm
B. time slice
C. cooperative multitasking
D. pre-emption
Answer: D
Pre-emption is an alternative method of the time slice where the currently running task can be stopped or preempted or switched out by a higher priority active task.
38. Which of the following requires programming within the application?
A. time slice
B. scheduling algorithm
C. pre-emption
D. cooperative multitasking
Answer: D
Cooperative multitasking requires programming within the application and the system can be destroyed by a single program that hogs all the processing power. Therefore, it is not applicable in the real-time operating system.
39. What does RMS stand for?
A. rate monotonic scheduling
B. rate machine scheduling
C. rate monotonic software
D. rate machine software
Answer: A
The rate of monotonic scheduling is a method that is used to assign priority for a pre-emptive system such that the correct execution can be guaranteed.
40. Which of the following task swapping method is a better choice in the embedded systems design?
A. RMS
B. pre-emptive
C. cooperative multitasking
D. time slice
Answer: B
The pre-emptive method of task swapping is the first choice for embedded system design because of its better system response.
