Embedded Real Time Operating System Set 5

On This Page

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

Q1 | Preemptive, priority based scheduling guarantees ____________
  • a) hard real time functionality
  • b) soft real time functionality
  • c) protection of memory
  • d) none of the mentioned
Q2 |  What is Event latency?
  • a) the amount of time an event takes to occur from when the system started
  • b) the amount of time from the event occurrence till the system stops
  • c) the amount of time from event occurrence till the event crashes
  • d) the amount of time that elapses from when an event occurs to when it is serviced.
Q3 | Real time systems need to __________ the interrupt latency.
  • minimize
  • maximize
  • not bother about
  • none of the mentioned
Q4 | The amount of time required for the scheduling dispatcher to stop one process and start another is known as ______________
  • a) event latency
  • b) interrupt latency
  • c) dispatch latency
  • d) context switch
Q5 | The most effective technique to keep dispatch latency low is to ____________
  • a) provide non preemptive kernels
  • b) provide preemptive kernels
  • c) make it user programmed
  • d) run less number of processes at a time
Q6 | Antilock brake systems, flight management systems, pacemakers are examples of
  • a) safety critical system
  • b) hard real time system
  • c) soft real time system
  • d) safety critical system and hard real time system
Q7 | In real time operating system ____________
  • a) all processes have the same priority
  • b) a task must be serviced by its deadline period
  • c) process scheduling can be done only once
  • d) kernel is not required
Q8 | In a real time system the computer results ____________
  • a) must be produced within a specific deadline period
  • b) may be produced at any time
  • c) may be correct
  • d) all of the mentioned
Q9 | . If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.B will have ______ percent of the total processor time.
  • a) 20
  • b) 15
  • c) 50
  • d) none of the mentioned
Q10 | Earliest deadline first algorithm assigns priorities according to ____________
  • a) periods
  • b) deadlines
  • c) burst times
  • d) none of the mentioned
Q11 | 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. The total CPU utilization is ____________
  • a) 0.90
  • b) 0.74
  • c) 0.94
  • d) 0.80
Q12 | 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., the priorities of P1 and P2 are?
  • a) remain the same throughout
  • b) keep varying from time to time
  • c) may or may not be change
  • d) none of the mentioned
Q13 | 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 two processes be scheduled using the EDF algorithm without missing their respective deadlines?
  • a) Yes
  • b) No
  • c) Maybe
  • d) None of the mentioned
Q14 | Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to __________
  • a) the cost of context switching
  • b) interrupt handling
  • c) power consumption
  • d) all of the mentioned
Q15 | If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.A will have ______ percent of the total processor time.
  • a) 20
  • b) 15
  • c) 50
  • d) none of the mentioned
Q16 | If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.C will have ______ percent of the total processor time.
  • a) 20
  • b) 15
  • c) 50
  • d) none of the mentioned
Q17 | If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.If a new process D requested 30 shares, the admission controller would __________
  • a) allocate 30 shares to it
  • b) deny entry to D in the system
  • c) all of the mentioned
  • d) none of the mentioned
Q18 | . In a real time system the computer results ____________
  • a) must be produced within a specific deadline period
  • b) may be produced at any time
  • c) may be correct
  • d) all of the mentioned
Q19 | In a safety critical system, incorrect operation ____________
  • a) does not affect much
  • b) causes minor problems
  • c) causes major and serious problems
  • d) none of the mentioned
Q20 | . The amount of memory in a real time system is generally ____________
  • a) less compared to PCs
  • b) high compared to PCs
  • c) same as in PCs
  • d) they do not have any memory
Q21 | What is the priority of a real time task?
  • a) must degrade over time
  • b) must not degrade over time
  • c) may degrade over time
  • d) none of the mentioned
Q22 | Memory management units ____________
  • a) increase the cost of the system
  • b) increase the power consumption of the system
  • c) increase the time required to complete an operation
  • d) all of the mentioned
Q23 | 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?
  • a) Yes
  • b) No
  • c) Maybe
  • d) None of the mentioned
Q24 | Type of processor in which single task of a particular application is process is termed as Select one:
  • a. real time processor
  • b. dedicated processor
  • c. applicant processor
  • d. one task processor
Q25 | Calculate the idle time of the processor with 3 periodic tasks whose execution times are given as 1, 1, and 3, and their periods are 3, 4, and 10. Select one: 17% 12% 88%
  • 0.17
  • 0.12
  • 0.88
  • 1