1. Identify the standard software components that can be reused?.
A. application manager.
B. operating system.
C. application software.
D. memory.
Answer= operating system
2. What does WCTE stand for?.
A. wait case execution time.
B. wait case encoder time.
C. worst case execution time.
D. worst code execution time.
Answer= worst case execution time
3. For which of the following WCET can be computed?.
A. C program.
B. assembly language.
C. VHDL.
D. program without recursion.
Answer= program without recursion
4. The WCET of which component can be computed if the task is mapped to hardware?.
A. hardware.
B. task.
C. both task and hardware.
D. application manager.
Answer= hardware
5. Which estimation approach is used by Jha and Dutt for hardware?.
A. accurate cost and performance value.
B. estimated cost and performance value.
C. performance value.
D. accurate cost.
Answer= estimated cost and performance value
6. Which estimate approach is more precise?.
A. estimated cost and performance value.
B. accurate cost and performance value.
C. performance value and execution time.
D. estimated cost.
Answer= accurate cost and performance value
7. Which estimate approach takes more time to consume?.
A. accurate value.
B. estimated value.
C. accurate cost and performance value.
D. estimated cost and performance value.
Answer= accurate cost and performance value
8. Which estimation techni can be used if interfaces to software synthesis tools and hardware synthesis tools exist?.
A. performance value.
B. estimated cost.
C. estimated cost and performance value.
D. accurate cost and performance value.
Answer= accurate cost and performance value
9. Which of the following is the base for scheduling algorithm?.
A. WCET.
B. time.
C. execution time.
D. address accessing time.
Answer= WCET
10. Which algorithm is based on Jackson's rule?.
A. EDD.
B. LL.
C. EDF.
D. LST.
Answer= EDD
11. What does EDD stand for?.
A. earliest device date.
B. earliest due date.
C. earliest device deadline.
D. earliest deadline device.
Answer= earliest due date
12. Which of the following can be implemented as static scheduling algorithm?.
A. EDF.
B. LL.
C. EDD.
D. LST.
Answer= EDD
13. What does EDF stand for?.
A. earliest deadline fix.
B. earliest due fix.
C. earliest due first.
D. earliest deadline first.
Answer= earliest deadline first
14. Which algorithm is dynamic scheduling algorithm?.
A. LL.
B. LST.
C. EDF.
D. EDD.
Answer= EDF
15. In which scheduling, the task priorities are a monotonically decreasing function of laxity?.
A. LL.
B. EDD.
C. EFD.
D. LST.
Answer= LL
16. Which scheduling algorithm is an optimal scheduling policy for mono-processor system?.
A. preemptive algorithm.
B. LST.
C. EDD.
D. LL.
Answer= LL
17. Which scheduling algorithm cannot be used with a standard OS providing fixed priorities?.
A. LL.
B. LST.
C. EDD.
D. EFD.
Answer= LL
18. Who proposed the LDF algorithm?.
A. Bayes.
B. Nyquist.
C. Lawler.
D. Stankovic.
Answer= Lawler
19. What does LDF stand for?.
A. last deadline first.
B. least deadline first.
C. list deadline first.
D. latest deadline first.
Answer= latest deadline first
20. Which algorithm is non-preemptive and can be used with a mono processor?.
A. LDF.
B. pre-emptive.
C. aperiodic.
D. LL.
Answer= LDF
21. Which algorithm requires the periodic checks of the laxity?.
A. LST.
B. LL.
C. EDD.
D. EFD.
Answer= LL
22. Who developed the heuristic algorithm?.
A. Stankovic and Ramamritham.
B. Stankovic and Lawler.
C. Lawler.
D. Stankovic.
Answer= Stankovic and Ramamritham
23. Which algorithm can be used if the preemptive is not allowed?.
A. heuristic algorithm.
B. LL.
C. EDD.
D. LST.
Answer= heuristic algorithm
24. Deadline interval ?�� execution time =
A. laxity.
B. execution time.
C. deadline interval.
D. period.
Answer= laxity
25. 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.
Answer= software and hardware deadline
26. 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= periodic task
27. Which of the task are not periodic?.
A. periodic task.
B. unpredictable task.
C. aperiodic task.
D. job.
Answer= aperiodic task
28. Which of the following is an aperiodic task resting the processor at unpredictable times?.
A. job.
B. aperiodic task.
C. sporadic.
D. periodic task.
Answer= sporadic
29. 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= non-preemptive scheduling
30. Which of the following schedulers take decisions at run-time?.
A. preemptive scheduler.
B. non preemptive scheduler.
C. dynamic scheduler.
D. static scheduler.
Answer= dynamic scheduler
31. Which scheduler takes their designs at design time?.
A. preemptive scheduler.
B. non preemptive scheduler.
C. dynamic scheduler.
D. static scheduler.
Answer= static scheduler
32. Which scheduler generates tables and forward to the dispatcher?.
A. static scheduler.
B. dynamic scheduler.
C. aperiodic scheduler.
D. preemptive scheduler.
Answer= static scheduler
33. 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= time triggered
34. What does TDL stand for?.
A. task descriptor list.
B. task design list.
C. temporal descriptor list.
D. temporal design list.
Answer= task descriptor list
35. Which scheduling algorithm can be used in mixed software/hardware systems?.
A. simple algorithm.
B. complex algorithm.
C. uniprocessor algorithm.
D. multiprocessor algorithm.
Answer= complex algorithm
36. Which algorithm can distinguish homogeneous multiprocessor system and heterogeneous multiprocessor system?.
A. complex algorithm.
B. simple algorithm.
C. scheduler algorithm.
D. preemptive algorithm.
Answer= complex algorithm
37. 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.
Answer= necessary test
38. 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.
Answer= sufficient test
39. Which algorithm can be used to schedule tasks at run-time?.
A. online scheduler.
B. offline scheduler.
C. multiprocessor scheduler.
D. uniprocessor scheduler.
Answer= online scheduler
40. The execution of the task is known as.
A. process.
B. job.
C. task.
D. thread.
Answer= job
41. Which scheduling algorithm is can be used for an independent periodic process?.
A. EDD.
B. LL.
C. LST.
D. RMS.
Answer= RMS
42. What is the relationship between the priority of task and their period in RMS?.
A. decreases.
B. increases.
C. remains unchanged.
D. linear.
Answer= decreases
43. Which of the following uses a preemptive periodic scheduling algorithm?.
A. Pre-emptive scheduling.
B. RMS.
C. LL.
D. LST.
Answer= RMS
44. Which of the following is based on static priorities?.
A. Periodic EDF.
B. RMS.
C. LL.
D. Aperiodic EDF.
Answer= RMS
45. How many assumptions have to meet for a rate monotonic scheduling?.
A. 3.
B. 4.
C. 5.
D. 6.
Answer= 6
46. Which of the following can be applied to periodic scheduling?.
A. EDF.
B. LL.
C. LST.
D. EDD.
Answer= EDF
47. Which of the following periodic scheduling is dynamic?.
A. RMS.
B. EDF.
C. LST.
D. LL.
Answer= EDF
48. Which of the following do the sporadic events are connected?.
A. Interrupts.
B. NMI.
C. Software interrupt.
D. Timer.
Answer= Interrupts
49. Which of the following can execute quickly, if the interrupt priority is higher in the system?.
A. EDD.
B. Sporadic event.
C. LL.
D. Aperiodic scheduling.
Answer= Sporadic event
50. Which of the following are used to execute at regular intervals and check for ready sporadic tasks?.
A. sporadic task server.
B. sporadic task client.
C. sporadic event application.
D. sporadic register.
Answer= sporadic task server
51. How is a sporadic task can turn into a periodic task?.
A. scheduling algorithm.
B. sporadic task event.
C. sporadic register.
D. sporadic task server.
Answer= sporadic task server
52. Which of the following is more difficult than the scheduling independent task?.
A. scheduling algorithm.
B. scheduling independent task.
C. scheduling dependent task.
D. aperiodic scheduling algorithm.
Answer= scheduling dependent task
53. Which scheduling is the basis for a number of formal proofs of schedulability?.
A. LL.
B. RMS.
C. LST.
D. EDD.
Answer= RMS
54. Which of the following is independent scheduling?.
A. LL.
B. LST.
C. EDD.
D. RMS.
Answer= RMS