MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 21 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. |
Deadline interval – execution time = |
| A. | laxity |
| B. | execution time |
| C. | deadline interval |
| D. | period |
| Answer» B. execution time | |
| 2. |
Which algorithm requires the periodic checks of the laxity? |
| A. | LST |
| B. | LL |
| C. | EDD |
| D. | EFD |
| Answer» C. EDD | |
| 3. |
Which algorithm is non-preemptive and can be used with a mono processor? |
| A. | LDF |
| B. | pre-emptive |
| C. | aperiodic |
| D. | LL |
| Answer» B. pre-emptive | |
| 4. |
What does LDF stand for? |
| A. | last deadline first |
| B. | least deadline first |
| C. | list deadline first |
| D. | latest deadline first |
| Answer» E. | |
| 5. |
What does EDF stand for? |
| A. | earliest deadline fix |
| B. | earliest due fix |
| C. | earliest due first |
| D. | earliest deadline first |
| Answer» E. | |
| 6. |
What does EDD stand for? |
| A. | earliest device date |
| B. | earliest due date |
| C. | earliest device deadline |
| D. | earliest deadline device |
| Answer» C. earliest device deadline | |
| 7. |
Which algorithm is based on Jackson’s rule? |
| A. | EDD |
| B. | LL |
| C. | EDF |
| D. | LST |
| Answer» B. LL | |
| 8. |
WHAT_DOES_LDF_STAND_FOR??$ |
| A. | last deadline first |
| B. | least deadline first |
| C. | list deadline first |
| D. | latest deadline first |
| Answer» E. | |
| 9. |
Which algorithm requires the periodic checks of the laxity?$ |
| A. | LST |
| B. | LL |
| C. | EDD |
| D. | EFD |
| Answer» C. EDD | |
| 10. |
Which algorithm is non-preemptive and can be used with a mono processor?$ |
| A. | LDF |
| B. | pre-emptive |
| C. | aperiodic |
| D. | LL |
| Answer» B. pre-emptive | |
| 11. |
Deadline interval – execution time =$ |
| A. | laxity |
| B. | execution time |
| C. | deadline interval |
| D. | period |
| Answer» B. execution time | |
| 12. |
Which algorithm can be used if the preemptive is not allowed? |
| A. | heuristic algorithm |
| B. | LL |
| C. | EDD |
| D. | LST |
| Answer» B. LL | |
| 13. |
Who developed the heuristic algorithm? |
| A. | Stankovic and Ramamritham |
| B. | Stankovic and Lawler |
| C. | Lawler |
| D. | Stankovic |
| Answer» B. Stankovic and Lawler | |
| 14. |
Who proposed the LDF algorithm? |
| A. | Bayes |
| B. | Nyquist |
| C. | Lawler |
| D. | Stankovic |
| Answer» D. Stankovic | |
| 15. |
Which scheduling algorithm cannot be used with a standard OS providing fixed priorities? |
| A. | LL |
| B. | LST |
| C. | EDD |
| D. | EFD |
| Answer» B. LST | |
| 16. |
Which scheduling algorithm is an optimal scheduling policy for mono-processor system? |
| A. | preemptive algorithm |
| B. | LST |
| C. | EDD |
| D. | LL |
| Answer» E. | |
| 17. |
In which scheduling, the task priorities are a monotonically decreasing function of laxity? |
| A. | LL |
| B. | EDD |
| C. | EFD |
| D. | LST |
| Answer» B. EDD | |
| 18. |
Which algorithm is dynamic scheduling algorithm? |
| A. | LL |
| B. | LST |
| C. | EDF |
| D. | EDD |
| Answer» D. EDD | |
| 19. |
Which of the following can be implemented as static scheduling algorithm? |
| A. | EDF |
| B. | LL |
| C. | EDD |
| D. | LST |
| Answer» D. LST | |
| 20. |
What is the full form of EDD in Aperiodic Scheduling? |
| A. | earliest device date |
| B. | earliest due date |
| C. | earliest device deadline |
| D. | earliest deadline device |
| Answer» C. earliest device deadline | |
| 21. |
Which algorithm is based on Jackson’s rule? |
| A. | EDD |
| B. | LL |
| C. | EDF |
| D. | LST |
| Answer» B. LL | |