MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Embedded Systems knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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» C. cooperative multitasking | |
| 2. |
What does RMS stand for? |
| A. | rate monotonic scheduling |
| B. | rate machine scheduling |
| C. | rate monotonic software |
| D. | rate machine software |
| Answer» B. rate machine scheduling | |
| 3. |
Which of the following requires programming within the application? |
| A. | time slice |
| B. | scheduling algorithm |
| C. | pre-emption |
| D. | cooperative multitasking |
| Answer» E. | |
| 4. |
WHICH_OF_THE_FOLLOWING_REQUIRES_PROGRAMMING_WITHIN_THE_APPLICATION??$ |
| A. | time slice |
| B. | scheduling algorithm |
| C. | pre-emption |
| D. | cooperative multitasking |
| Answer» E. | |
| 5. |
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» C. cooperative multitasking | |
| 6. |
What does RMS stand for?$ |
| A. | rate monotonic scheduling |
| B. | rate machine scheduling |
| C. | rate monotonic software |
| D. | rate machine software |
| Answer» B. rate machine scheduling | |
| 7. |
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» E. | |
| 8. |
Which of the following provides an illusion of multitasking? |
| A. | single task operating system |
| B. | multitasking operating system |
| C. | cooperative multitasking |
| D. | pre-emption |
| Answer» D. pre-emption | |
| 9. |
Which mechanism is used behind the Windows 3.1? |
| A. | time slice |
| B. | pre-emption |
| C. | cooperative multitasking |
| D. | scheduling algorithm |
| Answer» D. scheduling algorithm | |
| 10. |
Which can increase the number of task switches? |
| A. | time period |
| B. | frequency |
| C. | time rate |
| D. | number of cycles |
| Answer» B. frequency | |
| 11. |
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» E. | |
| 12. |
Which of the following can be used to distribute the time slice across all the task? |
| A. | timer |
| B. | counter |
| C. | round-robin |
| D. | task slicing |
| Answer» D. task slicing | |
| 13. |
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» D. scheduling task | |
| 14. |
Which task swap method works in a regular periodic point? |
| A. | pre-emption |
| B. | time slice |
| C. | schedule algorithm |
| D. | cooperative multitasking |
| Answer» C. schedule algorithm | |
| 15. |
Which task swapping method does not require the time critical operations? |
| A. | time slice |
| B. | pre-emption |
| C. | cooperative multitasking |
| D. | schedule algorithm |
| Answer» B. pre-emption | |