Multiple choice questions and answers
Hope the answers(bold) are correct. If any of the answer is wrong, please comment. I will check and update.
1. Response time
Hope the answers(bold) are correct. If any of the answer is wrong, please comment. I will check and update.
1. Response time
a. The length of time from the
release time of the job to the time instant when it completes
b. The instant in time when a job becomes available for execution
c. a and b
d. None of the above.
2. Clock driven scheduling applicable to deterministic systems
a. True
b. False
3. Which is soft real time system
a. Embedded navigation controller for autonomous robot weed killer
b. Avionics weapons delivery system in which pressing a button launches
an air-to-air missile
c. ATM
d. None of the above
4. Most scheduling algorithm used in non-real time systems are event
driven
a. True
b. False
5. FIFO algorithms assign priorities to jobs according to
a. Job execution time
b. Their release time
c. Ideal time
d. None of the above.
6. The release time of sporadic and aperiodic jobs are random
variables.
a. True
b. False
7. Which are examples of embedded system
a. Television
b. Modern automobile
c. Washing machine
d. All of the above
8. For developing real time system we can use
a. Real time OS
b. Real time network
c. Synchronous programming language
d. All of the above
9. The lateness of a job is the difference between its completion time
and its deadline
a. True
b. False
10. __________ algorithm allows us to determine whether all jobs in a
system indeed meet their timing constraint despite scheduling anomalies
a. Preemptive
b. Emptive
c. LST
d. Validation
11. If an aperiodic job is ready and the slack is > 0 then the
scheduler will not allow to execute aperiodic job.
a. True
b. False
12. ______________ systems are those in which scheduling is driven by
ongoing interaction with their environment
a. Embedded
b. Reactive
c. a and b
d. None of the above
13. _________ is a set of related jobs which jointly provide some
function
a. A task
b. A schedule
c. A job
d. None of the above
14. A job with hard or soft deadline is called
a. Laxity type
b. Relative deadline
c. Preemptivity
d. None of the above
15. Real time systems are synonymous with fast system
a. True
b. False
16. Can we use FORTRAN to write real time systems
a. True
b. False
17. An algorithm that is optimal for scheduling preemptive jobs on one
processor is
a. LST
b. MLF
c. a and b
d. None of the above
18. Priority driven algorithm is also known as
a. Event driven
b. Greedy scheduling
c. List scheduling
d. All of the above
19. A hard real time systems is the one which has predictable
performance with no deadline miss, even in case of sporadic tasks
a. True
b. False
20. A processor, is a passive entity upon which jobs may depend
a. True
b. False
21. Video transmission is an example of soft real time system
a. True
b. False
22. When job parameters with hard deadlines are known in advance, a
_______ (containing all scheduling decision times) can be constructed off line
a. Non static schedule
b. Periodic schedule
c. Static schedule
d. None of the above
23. Execution time
a. Is the instant of time by which the job must complete
b. Is the maximum allowable response time of the job
c. Is the instant of time at which the job become eligible for
execution
d. The amount of time required
to complete the execution of job when it executes alone and has all the
resources it requires
24. Arrival time
a. Is the instant of time by which the job must complete
b. Is the maximum allowable response time of the job
c. Is the instant of time at
which the job become eligible for execution
d. The amount of time required to complete the execution of job when it
executes alone and has all the resources it requires
25. Anti lock brakes are example of firm real time system
a. True
b. False
No comments:
Post a Comment