Font size
WorksheetsRTOS
Total questions: 40
Worksheet time: 23mins
Which one of the following is a real time operating system?
RTLinux
VxWorks
Windows CE
All of the mentioned
Antilock brake systems, flight management systems, pacemakers are examples of ____________
safety critical system
hard real time system
soft real time system
safety critical system and hard real time system
In a ______ real time system, it is guaranteed that critical real time tasks will be completed within their deadlines.
soft
hard
critical
none of the mentioned
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________
job queue
ready queue
execution queue
process queue
Preemptive, priority based scheduling guarantees ____________
hard real time functionality
soft real time functionality
protection of memory
none of the mentioned
Interrupt latency refers to the period of time ____________
from the occurrence of an event to the arrival of an interrupt
from the occurrence of an event to the servicing of an interrupt
from arrival of an interrupt to the start of the interrupt service routine
none of the mentioned
The amount of time required for the scheduling dispatcher to stop one process and start another is known as ______________
event latency
interrupt latency
dispatch latency
context switch
The most effective technique to keep dispatch latency low is to ____________
provide non preemptive kernels
provide preemptive kernels
make it user programmed
run less number of processes at a time
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
Which module gives control of the CPU to the process selected by the short-term scheduler?
dispatcher
interrupt
scheduler
none of the mentioned
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
all process
currently running process
parent process
init process
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
first-come, first-served scheduling
shortest job scheduling
priority scheduling
none of the mentioned
In priority scheduling algorithm ____________
CPU is allocated to the process with highest priority
CPU is allocated to the process with lowest priority
Equal priority processes can not be scheduled
None of the mentioned
Which algorithm is defined in Time quantum?
shortest job scheduling algorithm
round robin scheduling algorithm
priority scheduling algorithm
multilevel queue scheduling algorithm
Process are classified into different groups in ____________
shortest job scheduling algorithm
round robin scheduling algorithm
priority scheduling algorithm
multilevel queue scheduling algorithm
A process is selected from the ______ queue by the ________ scheduler, to be executed.
blocked, short term
wait, long term
ready, short term
ready, long term
The switching of the CPU from one process or thread to another is called ____________
process switch
task switch
context switch
all of the mentioned
Scheduling is done so as to ____________
increase CPU utilization
decrease the turnaround time
increase the throughput
All of the mentioned
What is Waiting time?
the total time in the blocked and waiting queues
the total time spent in the ready queue
the total time spent in the running queue
the total time from the completion till the submission of a process
Choose one of the disadvantages of the priority scheduling algorithm?
it schedules in a very complex manner
its scheduling takes up a lot of time
it can lead to some low priority process waiting indefinitely for the CPU
none of the mentioned
Which of the following statements are true?
i) Shortest remaining time first scheduling may cause starvation
ii) Preemptive scheduling may cause starvation
iii) Round robin is better than FCFS in terms of response time
i only
i and iii only
ii and iii only
i, ii and iii
Which of the following scheduling algorithms gives minimum average waiting time?
FCFS
SJF
Round – robin
Priority
Which one of the following is not shared by threads?
program counter
stack
both program counter and stack
none of the mentioned
A process can be ___________
single threaded
multithreaded
both single threaded and multithreaded
none of the mentioned
The time required to create a new thread in an existing process is ___________
greater than the time required to create a new process
less than the time required to create a new process
equal to the time required to create a new process
none of the mentioned
Round robin scheduling falls under the category of ____________
Non-preemptive scheduling
Preemptive scheduling
All of the mentioned
None of the mentioned
With round robin scheduling algorithm in a time shared system ____________
using very large time slices converts it into First come First served scheduling algorithm
using very small time slices converts it into First come First served scheduling algorithm
using extremely small time slices increases performance
using very small time slices converts it into Shortest Job First algorithm
A thread is also called ___________
Light Weight Process(LWP)
Heavy Weight Process(HWP)
Process
None of the mentioned
Termination of the process terminates ___________
first thread of the process
first two threads of the process
all threads within the process
no thread within the process
Thread synchronization is required because ___________
all threads of a process share the same address space
all threads of a process share the same global variables
all threads of a process can share the same files
all of the mentioned
What does a real-time kernel do?
Handles Concurrent and multitask execution
Interrupt Requests
Resource and time Management
All of the mentioned
How many different FreeRTOS memory management implementations are there?
4
2
1
3
Which state is implemented by a task but is not implemented by a co-routine?
Ready State
Running State
Suspended State
Blocked State
In FreeRTOS , When there are no tasks running, (a) will always run on the CPU.
(a) is responsible for freeing memory allocated by the FreeRTOS to tasks that have been deleted?
In FreeRTOS, an item is written to the queue using API (a)
In FreeRTOS the size of the queue item is set using Queue API
(a)
In FreeRTOS an item is read but not removed from a queue using API (a)
In FreeRTOS a semaphore is triggered using API (a)
A FreeRTOS task is suspended using API (a)
