Define RTOS.

Operating System with real time task scheduling, interrupt- latency

control, Synchronization of tasks with IPCs, predictable timing and
synchronization behavior of the system.
88. What is Round Robin or cyclic scheduling?
A scheduling algorithm in which the tasks are scheduled in sequence
from a list of ready tasks.
89. Explain briefly about Preemptive scheduling.
A scheduling algorithm in which a higher priority task is forced
(Preempted) to block by the scheduler.
90. What is Time Slicing and Fixed real time scheduling?
Time Slicing Scheduling
A scheduling algorithm in which each task is allotted a time slice after which
it is blocked and waits for its turn on the next cycle.
Fixed Real Time Scheduling
A scheduling strategy in which the time for each task is fixed
91. Explain briefly the term Process.
A code that has its independent program counters values and an
independent stack. A single CPU system runs one process (or one thread of a
process) at a time. It defines sequentially executing (running) program and its
state. A state, during the running of a process, is represented by its status (running,
blocked or finished), its control block, called process control block (PCB) or
process structure, its data, objects and resources.
92. What is Task?
A task is for the service of specific actions and may also correspond to the
codes, which execute for an interrupt. A task is an independent process that takes
control of the CPU when scheduled at an OS. Every task has a TCB ( Task
Control Block).
93. What is Task State?
A state of a task that changes on scheduler directions. A task at an instance
can be in one of the four states, idle, ready, blocked ad running that are controlled
by the scheduler.
94. Define inter process communication.
An output from one task (or process) passed to another task through the
scheduler and use of signals, exceptions, semaphores, queues, mailboxes, pipes,
sockets, and remote procedure call is known as inter process communication.

95. Define Semaphore.

Semaphore is a special variable or function that is used to take note of
certain actions to prevent another task or process from proceeding.
96. What is shared data problem?
If a variable is used in two different processes (tasks) and another task if interrupts
without before the operation on that is completed, then the shared data problem arises.
97. What is priority inversion problem? How it can be solved?
A problem in which a low priority task inadvertently does not release the
process for a higher priority task. An operating system can take care of this it by
appropriate provisions.
This problem can be solved by temporarily boosting the low priority task to
higher priority task which is called as priority inheritance.
98. Explain briefly Deadlock situation.
A task waiting for some semaphore the release of a semaphore from a task and
another a different task waiting for another semaphore release to run. None of these is
able to proceed further. An operating system can take care of this it by appropriate
provisions.
99. Explain the term (i) Message Queue (ii) Mailbox (iii) Pipe (iv) Socket.
Message Queue
A task sending the multiple FIFO or priority message into a queue for use by
another task(s) using queue message as an input.
Mailbox
A message(s) or message pointer from a task that is addressed to another task.
Pipe
A task sending the messages used by and another task using these as input. A
pipe can be a device like file which is also a virtual device.
Socket
It provides the logical link using a protocol between the tasks in a clientserver or peer-to-peer environment.
100. What is the use of Remote Procedure Call?
A method used for connecting two remotely placed methods by first using a
protocol for connecting the processes. It is used in the cases of distributed tasks.
101. Define Thread.
A minimum unit for a scheduler to schedule the CPU and other system resources. A
process may consist of multiple threads. A thread has an independent process control
block like a task control block and a thread also executes codes under the control of a
scheduler.
102. Difference between Mutex and Counting Semaphore.
Mutex Semaphore
Counting Semaphore
A special variable used to take note of
Certain actions to prevent any task or
Process from proceeding further and at
the same time let another task exclusively
proceed further

A semaphore in which the value of

which can be incremented and
decremented and which is not a
Boolean variable

103. Explain the uses of Task Control Block (TCB)?

A memory block holds information of program counter, memory map, the
signal (message) dispatch table, signal mask, task ID,CPU state (registers etc) and a
kernel stack (for executing system calls, etc.).
104. What are the problems that may arise while using
semaphores?
The problems that may while using semaphores are,
(i)
Sharing of two semaphores creates a deadlock problem.
(ii)
Without a timeout an ISR worst-case latency may exceed the deadline.
(iii)
A semaphore not taken and another task use a shared variable.
(iv)
When using multiple semaphores, if an unintended task takes the
semaphore, it creates a problem.
(v)
It may introduce priority inversion problem.
105. Explain any two features of RTOS.
The two features of RTOS are,
(i)
Each queue for a message may need initialization before using the
functions in the scheduler for the message queue.
(ii)
There may be a provision for multiple queues for the multiple types or
destination of messages. Each queue may have an id.
106. What are the strategies used by RTOS on interrupt source calls?
The strategies used by RTOS on interrupt source calls are,
(i)
Direct call to ISR by an interrupting source.
(ii)
Direct call to RTOS by an interrupting source and temporary suspension
of a scheduled task
(iii) Direct call to RTOS by an interrupting source and scheduling of tasks as
well as ISRs by RTOS.
107. Name some RTOS services.
(i) Basic OS functions
(ii) RTOS Main functions
(iii)
Time Management
(iv) Predictability