Embedded And Real Time System Set 6

Electrical Engineering

Practice Mode Previous Next
On This Page

This set of Embedded and Real Time System Multiple Choice Questions & Answers (MCQs) focuses on Embedded And Real Time System Set 6

Q1 | Time duration required for scheduling dispatcher to stop one process and start another is known as                          
  • process latency
  • dispatch latency
  • execution latency
  • interrupt latency
Answer: dispatch latency
Explaination:
none.
Q2 | Which one of the following is a real time operating system?
  • rtlinux
  • vxworks
  • windows ce
  • all of the mentioned
Answer: all of the mentioned
Explaination:
none.
Q3 | VxWorks is centered around
  • wind microkernel
  • linux kernel
  • unix kernel
  • none of the mentioned
Answer: wind microkernel
Explaination:
none.
Q4 | Identify the standard software components that can be reused?
  • application manager
  • operating system
  • application software
  • memory
Answer: operating system
Explaination:
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.
Q5 | What does WCTE stand for?
  • wait case execution time
  • wait case encoder time
  • worst case execution time
  • worst code execution time
Answer: worst case execution time
Explaination:
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.
Q6 | For which of the following WCET can be computed?
  • c program
  • assembly language
  • vhdl
  • program without recursion
Answer: program without recursion
Explaination:
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.
Q7 | The WCET of which component can be computed if the task is mapped to hardware?
  • hardware
  • task
  • both task and hardware
  • application manager
Answer: hardware
Explaination:
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.
Q8 | Which estimation approach is used by Jha and Dutt for hardware?
  • accurate cost and performance value
  • estimated cost and performance value
  • performance value
  • accurate cost
Answer: estimated cost and performance value
Explaination:
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
Q9 | Which estimate approach is more precise?
  • estimated cost and performance value
  • accurate cost and performance value
  • performance value and execution time
  • estimated cost
Answer: accurate cost and performance value
Explaination:
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.
Q10 | Which estimate approach takes more time to consume?
  • accurate value
  • estimated value
  • accurate cost and performance value
  • estimated cost and performance value
Answer: accurate cost and performance value
Explaination:
the accurate cost and the performance value method is time-consuming but the other estimating approaches are less time consuming.
Q11 | Which estimation technique can be used if interfaces to software synthesis tools and hardware synthesis tools exist?
  • performance value
  • estimated cost
  • estimated cost and performance value
  • accurate cost and performance value
Answer: accurate cost and performance value
Explaination:
the accurate cost and performance value is possible if interfaces to software synthesis tools and hardware synthesis tools exist.
Q12 | Which of the following is the base for scheduling algorithm?
  • wcet
  • time
  • execution time
  • address accessing time
Answer: wcet
Explaination:
the base for scheduling algorithm is the wcet, worst case execution time which is a bound on the execution time of tasks. such computing is undecidable in the general case, so it is decidable for certain programs only such as programs without recursion, iteration count, while loops etc.
Q13 | To schedule the processes, they are considered                    
  • infinitely long
  • periodic
  • heavy weight
  • light weight
Answer: periodic
Explaination:
none.
Q14 | If the period of a process is ‘p’, then what is the rate of the task?
  • p2
  • 2*p
  • 1/p
  • p
Answer: 1/p
Explaination:
none.
Q15 | The scheduler admits a process using
  • two phase locking protocol
  • admission control algorithm
  • busy wait polling
  • none of the mentioned
Answer: busy wait polling
Explaination:
none.
Q16 | Rate monotonic scheduling assumes that the                      
  • processing time of a periodic process is same for each cpu burst
  • processing time of a periodic process is different for each cpu burst
  • periods of all processes is the same
  • none of the mentioned
Answer: processing time of a periodic process is same for each cpu burst
Explaination:
none.
Q17 | In rate monotonic scheduling, a process with a shorter period is assigned                      
  • a higher priority
  • a lower priority
  • higher & lower priority
  • none of the mentioned
Answer: a higher priority
Explaination:
none.
Q18 | Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling?
  • yes
  • no
  • maybe
  • none of the mentioned
Answer: yes
Explaination:
none.
Q19 | If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then
  • they can be scheduled by edf algorithm
  • they cannot be scheduled by edf algorithm
  • they cannot be scheduled by any other algorithm
  • none of the mentioned
Answer: they cannot be scheduled by any other algorithm
Explaination:
none.
Q20 | A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?
  • yes
  • no
  • maybe
  • none of the mentioned
Answer: no
Explaination:
none.
Q21 | What type of fault remains in the system for some period and then disappears?
  • permanent
  • transient
  • intermittent
  • all of the mentioned
Answer: transient
Explaination:
for example many faults in
Q22 | Which of the following approaches are used to achieve reliable systems?
  • fault prevention
  • fault removal
  • fault tolerance
  • all of the mentioned
Answer: all of the mentioned
Explaination:
all the options lead to formation of a reliable system.
Q23 | A system maintaining its integrity while accepting a temporary halt in its operation is said to be in a state of
  • full fault tolerance
  • graceful degradation
  • fail soft
  • fail safe
Answer: fail safe
Explaination:
none.
Q24 | Which of the following Error Detection checks is not a part of Application detection?
  • hardware checks
  • timing checks
  • reversal checks
  • coding checks
Answer: hardware checks
Explaination:
hardware is a part of environment detection check.
Q25 | Exception handling is a type of
  • forward error recovery mechanism
  • backward error recovery mechanism
  • all of the mentioned
  • none of the mentioned
Answer: forward error recovery mechanism
Explaination:
exception handling is a forward error recovery mechanism, as there is no roll back to a previous state; instead control is passed to the handler so that recovery procedures can be initiated.
Previous Next