Execution Time Prediction MCQ Quiz – Objective Question with Answer for Prediction of Execution Time

21. Which algorithm can distinguish a homogeneous multiprocessor system and a heterogeneous multiprocessor system?

A. complex algorithm
B. simple algorithm
C. scheduler algorithm
D. preemptive algorithm

Answer: A

The simple algorithm can be used in handling single processors and the complex algorithm is used in mixed both in software and the hardware systems. It can also be used to distinguish between homogeneous multiprocessor systems and heterogeneous multiprocessor systems.

 

22. Which of the following scheduling test can be used to show that no schedule exist?

A. sufficient test
B. necessary test
C. complex test
D. simple test

Answer: B

The necessary and sufficient conditions are used in the schedulability test. For necessary conditions, the test is based only on the necessary conditions and it also can be used to show that no schedule exists. The sufficient condition indicates that no schedule exists even if there exists one.

 

23. Which scheduling test is used to indicate that no scheduling exists even if there exists one?

A. complex test
B. simple test
C. sufficient test
D. necessary test

Answer: C

The sufficient condition indicates that no schedule exists even if there exists one and the necessary condition indicates that no schedule exists even if a schedule exists.

 

24. Which algorithm can be used to schedule tasks at run-time?

A. online scheduler
B. offline scheduler
C. multiprocessor scheduler
D. uniprocessor scheduler

Answer: A

The online scheduling algorithm schedules tasks at run-time which is based on the information regarding the task whereas offline algorithms schedule tasks take a priori knowledge about the execution times, arrival times, and deadlines into account.

 

25. Which algorithm is based on Jackson’s rule?

A. EDD
B. LL
C. EDF
D. LST

Answer: A

The EDD or earliest due date is based on Jackson’s rule. Jackson’s rule states that for a given set of n independent tasks, any algorithm that executes the tasks in the order of nondecreasing deadlines is optimal with respect to reducing the maximum lateness. EDF is the earliest deadline first, LL is the least laxity and the LST is the least slack time first.

 

26. What does EDD stand for?

A. earliest device date
B. earliest due date
C. earliest device deadline
D. earliest deadline device

Answer: B

The earliest due date requires all tasks to be sorted by their deadlines and it is based on Jackson’s rule. If the deadlines are known, the EDD algorithm can be used.

 

27. Which of the following can be implemented as a static scheduling algorithm?

A. EDF
B. LL
C. EDD
D. LST

Answer: C

The EDD can be implemented as a static scheduling algorithm if the deadlines are known in advance and it follows Jackson’s rule.

 

28. What does EDF stand for?

A. earliest deadline fix
B. earliest due fix
C. earliest due first
D. earliest deadline first

Answer: D

The EDF stands for earliest deadline first. This algorithm is optimal with respect to minimizing the maximum lateness and is implemented as a dynamic scheduling algorithm for a set of n independent tasks with arbitrary arrival times, any algorithm that at any instant executes the task with the earliest absolute deadline among all the ready tasks is optimal with respect to minimizing the maximum lateness.

 

29. Which algorithm is a dynamic scheduling algorithm?

A. LL
B. LST
C. EDF
D. EDD

Answer: C

The EDF or earliest deadline first can be implemented as a dynamic scheduling algorithm.

Scroll to Top