Answer these 90+ Real-Time Systems and Software MCQs and assess your grip on the subject of Real-Time Systems and Software.
Scroll below and get started!
A. The sum of the maximum and the minimum start time of all periodic task instances.
B. The difference between the maximum and the minimum finish time of all periodic task instances.
C. The sum of the maximum and the minimum finish time of all periodic task instances.
D. The difference between the maximum and the minimum start time of all periodic task instances.
A. A test to determine the performance of a new system
B. A test to determine the accuracy of a new component
C. A schedulability test performed at the arrival time of a new task
D. A test to determine the feasibility of a new product
A. A kernel operation
B. Moving a task from a sleeping state to an active state
C. A state
D. Moving a task from an active state to a sleeping state
A. To regulate the admission of new tasks in the system
B. To manage the scheduling of tasks in the system
C. To monitor the performance of tasks in the system
D. To keep track of all tasks in the system
A. A task that consists of a sequence of identical jobs (instances), activated at regular intervals.
B. A task that consists of a sequence of different jobs (instances), activated at irregular intervals.
C. A task that consists of a sequence of different jobs (instances), activated at regular intervals.
D. A task that consists of a sequence of identical jobs (instances), activated at irregular intervals.
A. Departure
B. Arrival
C. Workload
D. Throughput
A. The time instant at which a job or a task enters the completed state.
B. The time instant at which a job or a task enters the running state.
C. The time instant at which a job or a task enters the blocked state.
D. The time instant at which a job or a task enters the ready queue.
A. Task-management policy used to execute low-priority tasks in the presence of low-priority tasks
B. Task-management policy used to execute low-priority tasks in the presence of high-priority tasks
C. Task-management policy used to execute high-priority tasks in the presence of low-priority tasks
D. Task-management policy used to execute high-priority tasks in the presence of high-priority tasks
A. A job is said to be blocked when it has to wait for a job having a higher priority.
B. When a process is waiting for an event that will never happen
C. A job is said to be blocked when it has to wait for a job having a lower priority.
D. When a process is waiting for another process to release a locked resource.
A. A temporary holding place for data
B. A memory area shared by two or more tasks for exchanging data.
C. A software device
D. A hardware device
A. Capacity
B. Service
C. Time
D. Maximum
A. The top part of a room
B. A device used to hoist something
C. Obstruction of view
D. Priority level associated with a semaphore or a resource according to an access protocol.
A. A short-term memory technique in which words are arranged in groups on a virtual
B. A special form of blocking introduced by the Priority Ceiling Protocol.
C. Both of these
D. None of these
A. A physical link that holds two or more devices together.
B. A link between task and kernel
C. The part of the CPU that performs arithmetic and logical operations
D. A logical link through which two or more tasks exchange information by a message-passing mechanism.
A. Completion time
B. Compilation time
C. Waiting time
D. Execution time
A. Retrieval time
B. Memory time
C. Instruction time
D. Service time or processing time
A. Programs that are executed one after the other.
B. Processes that overlap in time.
C. Processes that are waiting to be executed.
D. Two or more programs that are running at the same time.
A. The set of data required to restore a process to its previous state.
B. A set of data that describes the state of the memory at a particular time.
C. A set of data that describes the state of the processor at a particular time.
D. The ability of the processor to remember previous states.
A. The time at which the release of a job is indeterminate.
B. The time at which the release of a job has no effect on response time.
C. The time at which the release of a job produces the smallest response time.
D. The time at which the release of a job produces the largest response time.
A. A code segment that is not subject to mutual exclusion.
B. A code that is never executed.
C. A code segment that is always executed.
D. A code segment subject to a mutual exclusion.
A. The end of a job
B. The beginning of a job
C. The interval between a critical instant of a job and its corresponding finishing time.
D. The middle of a job
A. Minimum value
B. Total value
C. Maximum value
D. Cumulative value
A. On the due date
B. The time within which a real-time task should complete its execution.
C. Before the due date
D. After the due date
A. A situation in which two or more processes are waiting for an event to occur.
B. A situation where a process is waiting for an event that will never occur.
C. A situation where a process is waiting for another process to release a resource.
D. A situation in which two or more processes are waiting indefinitely for events that will never occur.
A. When two tasks are trying to access the same resource at the same time
B. When a task is unable to run because it is waiting for an event to happen
C. When a task is unable to run because it is waiting for another task to finish
D. A form of blocking due to the attempt of accessing an exclusive resource, held by another task.
A. Sending a message or letter
B. The act of moving something from one place to another
C. A type of Samba dance
D. The assignment of the processor to the task having highest priority
A. A game involving tiles
B. A phenomenon in which the arrival of a new task causes all previously guaranteed tasks to miss their deadlines.
C. When one thing causes another thing to happen and so on
D. A movie starring Tom Hanks
A. A planned or fixed occasion
B. A social occasion
C. An occurrence that requires a system reaction
D. A gathering of people for a particular purpose
A. Exceeding time
B. Job interval
C. Expiration date
D. Tardiness
A. A shared resource that cannot be accessed by more than one task at a time
B. A shared resource that can be accessed by only one task at a time
C. A shared resource that can be accessed by more than one task at a time
D. A resource that can be accessed by only one task at a time
A. A task that can be partially completed
B. A task that can be completed at any time
C. A task in which each instance must be either guaranteed to complete within its deadline or entirely rejected.
D. A task with no specific deadline
A. A test that verifies whether a task or set of tasks can complete within specified budget constraints.
B. A test that verifies whether a task or set of tasks can complete within specified timing constraints.
C. Both of these
D. None of these
A. A task whose instances must be a priori guaranteed to complete within their deadlines.
B. A task that is difficult to complete
C. A task that must be completed quickly
D. A task that is impossible to complete
A. Hyperperiod
B. Hypodermic
C. Schedule
D. Hyperactive
A. The state in which a task is active and waiting to be completed.
B. The state in which a task is notactive and waiting to be started.
C. The state in which a task is completed and waiting to be started.
D. The state in which a task is not active and waits to be activated.
A. Time during which a processor can accept and respond to requests.
B. Time in which the processor is executing a task.
C. Time interval between starting and completing a task.
D. Time in which the processor does not execute any task.
A. A particular execution of a schedule.
B. The sequence of jobs that characterize a periodic task.
C. A single job belonging to the sequence of jobs that characterize a periodic or an aperiodic task.
D. The sequence of jobs that characterize an aperiodic task.
A. The time interval between the activation of two consecutive instances of the same task.
B. The time interval between the deactivation of two consecutive instances of the same task.
C. Both of these
D. None of these
A. The act of moving back and forth quickly
B. A type of coffee
C. The difference between two average values
D. The difference between the start times of two or more instances of a periodic task.
A. An operating system that allows multiple tasks to share common resources
B. An operating environment that enables a set of tasks to execute concurrently on a single processor.
C. Both of these
D. None of these
A. The maximum delay that a job can experience after its activation and still complete within its deadline.
B. The minimum delay that a job can experience before its activation and still complete within its deadline.
C. Both of these
D. None of these
A. Leisure time
B. Free time
C. Slack time
D. Idle time
A. 5 years
B. 2 years
C. 10 years
D. Lifetime
A. Length of the Correct time interval
B. Length of the Computation time interval
C. Load of the Computation time interval
D. Load Computation time demanded by a task set in an interval, divided by the length of the interval.
A. A device used to store unread messages
B. A device used to store read messages.
C. A communication buffer characterized by a message queue shared between two or more jobs.
D. A device used to store sent messages
A. A race condition where the output of a program depends on the order in which processes execute
B. A kernel mechanism that serializes the execution of concurrent tasks on critical sections of code.
C. Both of these
D. None of these
A. A scheduling algorithm that minimizes some cost function defined over the task set.
B. An algorithm that schedules processes in a way that minimizes the amount of time spent waiting
C. Both of these
D. None of these
A. Kernel time
B. User time
C. System time
D. Overhead
A. Exceptional load condition on the processor
B. Increased resistance in an electrical circuit
C. More work than can be done
D. Too much information
A. The interval of time between the activation of two consecutive instances of a periodic task.
B. The rate at which an event occurs.
C. The amount of time it takes for a single wave to pass a given point.
D. The number of times an event repeats itself over a given unit of time.