Embedded Real Time Operating System Set 6

On This Page

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

Q1 | In rate monotonic scheduling algorithm Select one:
  • shorter duration job has higher priority,
  • longer duration job has higher priority
  • priority does not depend on the duration of the job
  • none of the mentioned
Q2 | Tasks whose execution would begin randomly and within the interval of arrival times of consecutive tasks is known as
  • Periodic Task
  • Aperiodic Task
  • Sporadic Task
  • none of the mentioned
Q3 | What is True for a task vis-à-vis a process?
  • Tasks are complex compared to processes
  • Tasks represent only a single sequence of instructions
  • Processes can spawn threads but tasks cannot spawn tasks Tasks and processes are one and the same thing
  • Tasks and processes are one and the same thing
Q4 | What does the utilization rate tells us? Select one:
  • If it is larger or equal to 1, the system is not feasible
  • If it is smaller than 1, the system is feasible
  • If it is exactly 1, the system is feasible
  • if there is no context switch overhead If it is 0, the system is absolutely feasible
Q5 | if jobs have unpredictable release times, a task is termed :
  • aperiodic
  • sporadic periodic.
  • both
  • None of these
Q6 | What is TRUE for an aperiodic task and a sporadic task:
  • A sporadic task and an aperiodic task are one and the same thing
  • An aperiodic task occurs randomly and has hard real time requirements
  • A sporadic task occurs randomly and has hard real time requirements
  • A sporadic task becomes aperiodic when it is executed with a periodic task
Q7 | State whether the following statements are True or False for the features of real time operating system.i) fast process or thread switch ii) ability to respond to external interrupts quickly. iii) minimization of intervals during which interrupts are enabled. iv) preemptive scheduling based on priority
  • i, ii and iii only
  • ii, iii and iv only
  • i, ii and iv only
  • All i, ii, iii and iv
Q8 | Effective release time of a job without the predecessors is equal to its given …………….
  • release time
  • Deadline
  • both
  • None of these
Q9 | Effective deadline of job without the successor is equal to its given ……………
  • release time
  • Deadline
  • both
  • None of these
Q10 | Effective deadline of job with successor is equal tothe minimum value among its deadlines and …………………………
  • only deadline of job
  • Release time of all the successors
  • deadlines of all the successors
  • None of these
Q11 | LRT schedules all the job backward from …………………... of all the job in priority driven manner to the current time.
  • Earliest deadline
  • latest deadline
  • latest releasetime
  • None of these
Q12 | In on-line scheduling, scheduler make the schedule ……………………... that will be released in future.
  • with the knowledge of the jobs
  • without the knowledge of the jobs
  • both
  • None of these
Q13 | 5. In which scheduling certain amount of CPU time is allocated to each process?
  • a) earliest deadline first scheduling
  • b) proportional share scheduling
  • c) equal share scheduling
  • d) none of the mentioned
Q14 | Time duration required for scheduling dispatcher to stop one process and start another is known as ____________
  • a) process latency
  • b) dispatch latency
  • c) execution latency
  • d) interrupt latency
Q15 | Scheduling of tasks is a very important consideration in RTOS. Which of the following best described the scheduling policy design:
  • a. The scheduler must follow a pre-emptive policy
  • b. The scheduler must not use pre-emptive policy option
  • c. The scheduler must not only use pre-emptive policy options with the priority considerations.
  • d. The scheduler must not use pre-emptive policy option, but must employ priority consideration.
Q16 | Preemptive, priority based scheduling guarantees ____________
  • a) hard real time functionality
  • b) soft real time functionality
  • c) protection of memory
  • d) none of the mentioned