54 + Interview Questions in Embedded Operating System in Embedded Systems Page 1 InterviewSolution

1.	Who proposed the LDF algorithm?(a) Bayes(b) Nyquist(c) Lawler(d) StankovicThis question was posed to me by my college director while I was bunking the class.The question is from Aperiodic Scheduling in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct OPTION is (C) Lawler Best explanation: The latest deadline first or LDF is proposed by Lawler which performs a TOPOLOGICAL SORT. It is based on the TOTAL order compatible with the partial order with respect to the task graph.

Discussion

2.	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 testThe question was asked in an interview for job.My query is from Classification of Scheduling Algorithms topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» CORRECT OPTION is (b) necessary test Easiest explanation: The necessary and sufficient conditions are USED in the schedulability test. For necessary condition, 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.

Discussion

3.	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 valueThis question was addressed to me in class test.The query is from Prediction of Execution Times topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct ANSWER is (C) accurate COST and performance value The explanation is: The accurate cost and the performance value method is time-CONSUMING but the other estimating APPROACHES are less time consuming.

Discussion

4.	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 algorithmThe question was asked in an international level competition.This intriguing question comes from Periodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right option is (c) scheduling dependent task To elaborate: The scheduling dependent task is more difficult than the independent scheduling task. The problem of deciding WHETHER or not a SCHEDULE EXISTS for a given set of dependent tasks and a given DEADLINE is NP-complete.

Discussion

5.	Which algorithm can distinguish homogeneous multiprocessor system and heterogeneous multiprocessor system?(a) complex algorithm(b) simple algorithm(c) scheduler algorithm(d) preemptive algorithmI had been asked this question in semester exam.The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (a) complex ALGORITHM Explanation: 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 homogeneous multiprocessor system and heterogeneous multiprocessor systems. The complex algorithm can be used to handle multiple processors WHEREAS.

Discussion

6.	Deadline interval – execution time =(a) laxity(b) execution time(c) deadline interval(d) periodThe question was posed to me during a job interview.Asked question is from Aperiodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct option is (a) LAXITY For explanation: The laxity is defined as the deadline interval MINUS the EXECUTION time. It is also known as the slack.

Discussion

7.	Which of the following systems are entirely controlled by the timer?(a) voltage triggered(b) time triggered(c) aperiodic task scheduler(d) periodic task schedulerThis question was addressed to me in an international level competition.I'd like to ask this question from Classification of Scheduling Algorithms topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» CORRECT answer is (b) time triggered To explain I would say: The systems which are entirely controlled by a TIMER are known as entirely time-triggered systems. A temporal CONTROL structure is associated with the entirely time-triggered system which is encoded in a TDL, task DESCRIPTOR list.

Discussion

8.	Which of the following is the base for scheduling algorithm?(a) WCET(b) time(c) execution time(d) address accessing timeI got this question in unit test.Enquiry is from Prediction of Execution Times in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer»

Discussion

9.	For which of the following WCET can be computed?(a) C program(b) assembly language(c) VHDL(d) program without recursionThis question was posed to me in homework.My question is from Prediction of Execution Times topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct choice is (d) program without recursion The best I can explain: The WCET COMPUTING is a difficult task for assembly language and for computing WCTE for any high-level language without the knowledge of the generated assembly CODE is impossible.

Discussion

10.	Which algorithm is dynamic scheduling algorithm?(a) LL(b) LST(c) EDF(d) EDDThe question was posed to me during a job interview.Query is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT CHOICE is (c) EDF To explain: The EDF or EARLIEST DEADLINE first can be implemented as a dynamic SCHEDULING algorithm.

Discussion

11.	Which of the task are not periodic?(a) periodic task(b) unpredictable task(c) aperiodic task(d) jobThis question was posed to me in an international level competition.This intriguing question comes from Classification of Scheduling Algorithms topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The CORRECT choice is (c) aperiodic task To explain I would SAY: The aperiodic task is the ONE in which the task is not periodic but the periodic task is the one in which are the task are periodic. Each EXECUTION of a periodic task is known as the job.

Discussion

12.	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 deadlineI had been asked this question during an interview for a job.The origin of the question is Classification of Scheduling Algorithms in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (a) software and hardware deadline Explanation: The real-time SCHEDULING can be classified into various criteria. The fundamental classification is the software and hardware deadline which is based on the EXTENSION to standard operating SYSTEMS.

Discussion

13.	Which of the following periodic scheduling is dynamic?(a) RMS(b) EDF(c) LST(d) LLI have been asked this question by my school teacher while I was bunking the class.Enquiry is from Periodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The CORRECT option is (b) EDF To elaborate: The EDF or the earliest deadline first is a PERIODIC scheduling algorithm which is DYNAMIC but RMS or rate MONOTONIC scheduling is the periodic algorithm which is static. The LL and LST are aperiodic scheduling algorithm.

Discussion

14.	Which algorithm is non-preemptive and can be used with a mono processor?(a) LDF(b) pre-emptive(c) aperiodic(d) LLI got this question during an internship interview.Query is from Aperiodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct choice is (a) LDF To explain: The latest deadline first or LDF is a non-preemptive SCHEDULING ALGORITHM and can be USED with a mono processor whereas LL or LEAST laxity is a preemptive scheduling algorithm.

Discussion

15.	What does EDF stand for?(a) earliest deadline fix(b) earliest due fix(c) earliest due first(d) earliest deadline firstI got this question during an online interview.The above asked question is from Aperiodic Scheduling in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct answer is (d) EARLIEST deadline first Easiest explanation: The EDF stands for earliest deadline first. This algorithm is optimal with respect to minimizing the maximum LATENESS and is implemented as 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.

Discussion

16.	The execution of the task is known as(a) process(b) job(c) task(d) threadThis question was posed to me in a job interview.This key question is from Periodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The CORRECT ANSWER is (b) job For explanation I WOULD say: The execution of the task is known as the job. The time for both the execution of the task and the CORRESPONDING job is same.

Discussion

17.	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) processI had been asked this question in my homework.My enquiry is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right option is (B) periodic task The explanation: The periodic task is the one which must be executed in a DEFINED UNIT of time say ‘P’ where p is CALLED the period.

Discussion

18.	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 schedulingI got this question during an interview for a job.Query is from Periodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT answer is (b) Sporadic event The best explanation: The sporadic EVENTS are connected to the interrupts and execute them IMMEDIATELY because the INTERRUPT priority is the highest priority level in the system.

Discussion

19.	Which of the following is based on static priorities?(a) Periodic EDF(b) RMS(c) LL(d) Aperiodic EDFI got this question during an interview for a job.Query is from Periodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (b) RMS Easiest explanation: The rate monotonic scheduling is a periodic scheduler ALGORITHM which FOLLOWS a preemptive algorithm and have STATIC PRIORITIES. EDF and LL have DYNAMIC priorities.

Discussion

20.	What does EDD stand for?(a) earliest device date(b) earliest due date(c) earliest device deadline(d) earliest deadline deviceI got this question in an interview.My question is taken from Aperiodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right option is (b) earliest due DATE The explanation is: 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, EDD algorithm can be used.

Discussion

21.	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 managerI have been asked this question in exam.The question is from Prediction of Execution Times in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The CORRECT option is (a) hardware Easiest explanation: The worst CASE EXECUTION time of the hardware can be computed if the TASK is MAPPED to the hardware which in turn requires the synthesis of the hardware.

Discussion

22.	Who developed the heuristic algorithm?(a) Stankovic and Ramamritham(b) Stankovic and Lawler(c) Lawler(d) StankovicI had been asked this question in a national level competition.Origin of the question is Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT OPTION is (a) Stankovic and RAMAMRITHAM Explanation: The heuristic algorithm is DEVELOPED by Stankovic and Ramamritham in 1991.

Discussion

23.	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 testThis question was addressed to me in unit test.I need to ask this question from Classification of Scheduling Algorithms in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT answer is (C) sufficient test Easiest EXPLANATION: The sufficient condition INDICATES that no schedule EXISTS even if there exist one and the necessary condition indicates that no schedule exists even if a schedule exists.

Discussion

24.	What does WCTE stand for?(a) wait case execution time(b) wait case encoder time(c) worst case execution time(d) worst code execution timeI had been asked this question in my homework.The query is from Prediction of Execution Times in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct choice is (c) worst case execution TIME For EXPLANATION I would say: The WCTE is the worst case execution time which is an upper bound on the execution times of task. It can be COMPUTED for certain programs like while loops, programs without recursion, iteration count etc.

Discussion

25.	Which of the following is independent scheduling?(a) LL(b) LST(c) EDD(d) RMSI had been asked this question in an internship interview.This intriguing question originated from Periodic Scheduling in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct answer is (d) RMS The best I can explain: The RMS or rate monotonic scheduling is the independent scheduling ALGORITHM which is INCLUDED in the ASSUMPTIONS of RMS, that is, all tasks should be independent.

Discussion

26.	What does LDF stand for?(a) last deadline first(b) least deadline first(c) list deadline first(d) latest deadline firstI have been asked this question in an interview.Question is taken from Aperiodic Scheduling in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct choice is (d) latest DEADLINE first To explain: The LDF or latest deadline first is a SCHEDULING algorithm which is PROPOSED by Lawler.

Discussion

27.	Which algorithm can be used to schedule tasks at run-time?(a) online scheduler(b) offline scheduler(c) multiprocessor scheduler(d) uniprocessor schedulerI got this question by my school principal while I was bunking the class.My question comes from Classification of Scheduling Algorithms topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct ANSWER is (a) ONLINE scheduler Explanation: The online scheduling algorithm SCHEDULE 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.

Discussion

28.	Which scheduling algorithm can be used in mixed software/hardware systems?(a) simple algorithm(b) complex algorithm(c) uniprocessor algorithm(d) multiprocessor algorithmI got this question in quiz.My query is from Classification of Scheduling Algorithms in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» CORRECT OPTION is (B) complex ALGORITHM Explanation: The complex algorithm is used in mixed software/hardware systems. It can be used to handle multiple processors.

Discussion

29.	Which scheduler generates tables and forward to the dispatcher?(a) static scheduler(b) dynamic scheduler(c) aperiodic scheduler(d) preemptive schedulerI had been asked this question in my homework.I'm obligated to ask this question of Classification of Scheduling Algorithms topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right choice is (a) STATIC scheduler For explanation I would say: The static scheduler generates tables of start times which are FORWARDED to a simple dispatcher and it can be controlled by a timer which MAKES the dispatcher ANALYZE the table.

Discussion

30.	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 schedulingThe question was asked in unit test.The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (c) non-PREEMPTIVE SCHEDULING Explanation: The nonpreemptive scheduling is based on the assumptions that the tasks are executed until the task is done whereas the preemptive scheduling is USED if the task has long execution times or for a SHORT RESPONSE time.

Discussion

31.	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 costThe question was posed to me by my college director while I was bunking the class.This intriguing question comes from Prediction of Execution Times topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct answer is (b) estimated COST and performance value For EXPLANATION I would say: There are DIFFERENT estimation techniques used. ONE such is the estimated cost and performance value which is proposed by Jha and Dutt for HARDWARE. The accurate cost and performance value is proposed by Jain et al for software.

Discussion

32.	Which of the following can be applied to periodic scheduling?(a) EDF(b) LL(c) LST(d) EDDThe question was posed to me in an interview for job.My question is from Periodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct choice is (a) EDF To explain: The EARLIEST deadline FIRST can be applied both to the periodic and aperiodic scheduling algorithm. But LL, LST, and EDD are aperiodic scheduling. It is not applicable to the periodic scheduling.

Discussion

33.	How many assumptions have to meet for a rate monotonic scheduling?(a) 3(b) 4(c) 5(d) 6I got this question in a job interview.My query is from Periodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right choice is (d) 6 Easiest explanation: The rate monotonic scheduling has to meet six ASSUMPTIONS. These are: All the TASKS should be periodic,all the tasks must be independent, the deadline should be equal to the period for all tasks, the execution time must be CONSTANT, the time required for the context SWITCHING must be negligible, it should hold the accumulation UTILIZATION equation.

Discussion

34.	Which scheduling algorithm is can be used for an independent periodic process?(a) EDD(b) LL(c) LST(d) RMSThe question was posed to me during an interview.Question is from Periodic Scheduling in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer»

Discussion

35.	Which algorithm is based on Jackson’s rule?(a) EDD(b) LL(c) EDF(d) LSTThe question was posed to me in my homework.This interesting question is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right answer is (a) EDD For EXPLANATION I would SAY: The EDD or earliest due date is based on Jackson’s rule. The Jackson’s rule states that for a given a 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.

Discussion

36.	What does TDL stand for?(a) task descriptor list(b) task design list(c) temporal descriptor list(d) temporal design listThe question was posed to me in a national level competition.My enquiry is from Classification of Scheduling Algorithms in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Right choice is (a) TASK descriptor LIST To explain I would say: TDL is a task descriptor list which contains the CYCLIC schedule for all activities of the node and the temporal CONTROL STRUCTURE is encoded by the task descriptor table.

Discussion

37.	Which scheduling is the basis for a number of formal proofs of schedulability?(a) LL(b) RMS(c) LST(d) EDDI had been asked this question in an international level competition.My doubt stems from Periodic Scheduling topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT option is (b) RMS To elaborate: The rate monotonic SCHEDULING which is an INDEPENDENT scheduling algorithm form the basis for a NUMBER of FORMAL proofs of schedulability.

Discussion

38.	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 registerI have been asked this question during an interview.This interesting question is from Periodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT option is (a) sporadic task server To elaborate: The special sporadic task SERVERS are used that execute at regular intervals and check for ready sporadic tasks which IMPROVE the predictability of the whole SYSTEM.

Discussion

39.	Which of the following uses a preemptive periodic scheduling algorithm?(a) Pre-emptive scheduling(b) RMS(c) LL(d) LSTI had been asked this question in class test.I need to ask this question from Periodic Scheduling topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct CHOICE is (b) RMS Easiest EXPLANATION: The rate monotonic scheduling is a PERIODIC scheduler algorithm which FOLLOWS a preemptive algorithm. LL is also preemptive scheduling but it is aperiodic scheduling algorithm.

Discussion

40.	What is the relationship between the priority of task and their period in RMS?(a) decreases(b) increases(c) remains unchanged(d) linearI have been asked this question during an online exam.I need to ask this question from Periodic Scheduling in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» CORRECT OPTION is (a) decreases Explanation: The PRIORITY of the task decreases monotonically with respect to their period in the rate MONOTONIC scheduling, that is, the task with the long period will GET a low priority but task with the short period will get a high priority.

Discussion

41.	Which estimation technique 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 valueThe question was asked in an internship interview.My question is based upon Prediction of Execution Times topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct answer is (d) accurate COST and performance value The EXPLANATION is: The accurate cost and performance value is possible if INTERFACES to software synthesis TOOLS and hardware synthesis tools exist.

Discussion

42.	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 costThe question was asked by my school principal while I was bunking the class.This intriguing question comes from Prediction of Execution Times in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT answer is (b) accurate cost and performance value The best I can explain: The accurate cost and performance value is POSSIBLE if interfaces to software SYNTHESIS tools and hardware synthesis tools exist and is more PRECISE than any other methods.

Discussion

43.	Which algorithm requires the periodic checks of the laxity?(a) LST(b) LL(c) EDD(d) EFDThis question was addressed to me during an online exam.I'm obligated to ask this question of Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct OPTION is (b) LL The EXPLANATION is: The LL scheduling ALGORITHM requires the knowledge of the execution times and the periodic check of the LAXITY.

Discussion

44.	Which of the following can be implemented as static scheduling algorithm?(a) EDF(b) LL(c) EDD(d) LSTThe question was asked during an online exam.This intriguing question originated from Aperiodic Scheduling in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct choice is (c) EDD To ELABORATE: The EDD can be implemented as static SCHEDULING algorithm if the DEADLINES are known in advance and it follows Jackson’s rule.

Discussion

45.	Which of the following is an aperiodic task requesting the processor at unpredictable times?(a) job(b) aperiodic task(c) sporadic(d) periodic taskThis question was addressed to me in an interview.My question is from Classification of Scheduling Algorithms in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» CORRECT option is (C) SPORADIC Easiest explanation: The aperiodic tasks request the PROCESSOR at unpredictable times if and only if there is a minimum separation between the times at which they request the processor which is CALLED sporadic.

Discussion

46.	Identify the standard software components that can be reused?(a) application manager(b) operating system(c) application software(d) memoryThe question was posed to me in an interview.The origin of the question is Prediction of Execution Times topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» The correct OPTION is (b) operating system To elaborate: There are certain software COMPONENTS that can be reused in an EMBEDDED system design. These are the operating SYSTEMS, real-time databases and some other forms of middleware.

Discussion

47.	Which scheduling algorithm is an optimal scheduling policy for mono-processor system?(a) preemptive algorithm(b) LST(c) EDD(d) LLThis question was addressed to me in an online interview.Enquiry is from Aperiodic Scheduling in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» RIGHT choice is (d) LL The best I can explain: The LEAST laxity algorithm is a DYNAMIC scheduling algorithm and hence it can be IMPLEMENTED as an optimal scheduling policy for the mono-processor system. The LL scheduling algorithm is ALSO preemptive scheduling.

Discussion

48.	Which algorithm can be used if the preemptive is not allowed?(a) heuristic algorithm(b) LL(c) EDD(d) LSTThis question was addressed to me at a job interview.Enquiry is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct choice is (a) heuristic algorithm The EXPLANATION is: The heuristic algorithm was proposed by Stankovic and Ramamritham in 1991 can be USED if the PREEMPTION is not ALLOWED.

Discussion

49.	How is a sporadic task can turn into a periodic task?(a) scheduling algorithm(b) sporadic task event(c) sporadic register(d) sporadic task serverThe question was asked in an interview for job.I'm obligated to ask this question of Periodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer»

Discussion

50.	Which of the following do the sporadic events are connected?(a) Interrupts(b) NMI(c) Software interrupt(d) TimerI got this question in examination.My question comes from Periodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems
Answer» Correct option is (a) Interrupts Explanation: The sporadic EVENTS are CONNECTED to the interrupts thereby execute them IMMEDIATELY as POSSIBLE since the interrupt PRIORITY is the highest in the system.

Discussion

Explore topic-wise InterviewSolutions in .

Who proposed the LDF algorithm?(a) Bayes(b) Nyquist(c) Lawler(d) StankovicThis question was posed to me by my college director while I was bunking the class.The question is from Aperiodic Scheduling in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

Deadline interval – execution time =(a) laxity(b) execution time(c) deadline interval(d) periodThe question was posed to me during a job interview.Asked question is from Aperiodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following is the base for scheduling algorithm?(a) WCET(b) time(c) execution time(d) address accessing timeI got this question in unit test.Enquiry is from Prediction of Execution Times in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which algorithm is dynamic scheduling algorithm?(a) LL(b) LST(c) EDF(d) EDDThe question was posed to me during a job interview.Query is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following periodic scheduling is dynamic?(a) RMS(b) EDF(c) LST(d) LLI have been asked this question by my school teacher while I was bunking the class.Enquiry is from Periodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which algorithm is non-preemptive and can be used with a mono processor?(a) LDF(b) pre-emptive(c) aperiodic(d) LLI got this question during an internship interview.Query is from Aperiodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

The execution of the task is known as(a) process(b) job(c) task(d) threadThis question was posed to me in a job interview.This key question is from Periodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following is based on static priorities?(a) Periodic EDF(b) RMS(c) LL(d) Aperiodic EDFI got this question during an interview for a job.Query is from Periodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

What does EDD stand for?(a) earliest device date(b) earliest due date(c) earliest device deadline(d) earliest deadline deviceI got this question in an interview.My question is taken from Aperiodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following is independent scheduling?(a) LL(b) LST(c) EDD(d) RMSI had been asked this question in an internship interview.This intriguing question originated from Periodic Scheduling in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

What does LDF stand for?(a) last deadline first(b) least deadline first(c) list deadline first(d) latest deadline firstI have been asked this question in an interview.Question is taken from Aperiodic Scheduling in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following can be applied to periodic scheduling?(a) EDF(b) LL(c) LST(d) EDDThe question was posed to me in an interview for job.My question is from Periodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

How many assumptions have to meet for a rate monotonic scheduling?(a) 3(b) 4(c) 5(d) 6I got this question in a job interview.My query is from Periodic Scheduling in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which scheduling algorithm is can be used for an independent periodic process?(a) EDD(b) LL(c) LST(d) RMSThe question was posed to me during an interview.Question is from Periodic Scheduling in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which algorithm is based on Jackson’s rule?(a) EDD(b) LL(c) EDF(d) LSTThe question was posed to me in my homework.This interesting question is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which algorithm requires the periodic checks of the laxity?(a) LST(b) LL(c) EDD(d) EFDThis question was addressed to me during an online exam.I'm obligated to ask this question of Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following can be implemented as static scheduling algorithm?(a) EDF(b) LL(c) EDD(d) LSTThe question was asked during an online exam.This intriguing question originated from Aperiodic Scheduling in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which algorithm can be used if the preemptive is not allowed?(a) heuristic algorithm(b) LL(c) EDD(d) LSTThis question was addressed to me at a job interview.Enquiry is from Aperiodic Scheduling topic in section Embedded Operating System, Middleware and Scheduling of Embedded Systems

Which of the following do the sporadic events are connected?(a) Interrupts(b) NMI(c) Software interrupt(d) TimerI got this question in examination.My question comes from Periodic Scheduling topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems