Module 3
Module 3
- Questions
3. Differentiate between hard real-time and soft real-time systems with an example
for each.
4. Define the term operating system. With a neat diagram, explain its architecture.
5. Explain the concept of deadlock with a neat diagram. Mention the different condi-
tions which favor a deadlock situation.
6. Explain different conditions that favor deadlock. Explain techniques to detect and
prevent deadlock.
7. With a block diagram, explain the concept of a counting semaphore. Give a real-
world example.
1
Scheduling Algorithms
1. For the following jobs, calculate the turnaround time and waiting time using pre-
emptive SJF scheduling algorithm:
Job Arrival Time CPU Burst Time
J1 0.0 ms 10 ms
J2 2.0 ms 5 ms
J3 4.0 ms 3 ms
J4 5.0 ms 4 ms
2. Three processes P1, P2, P3 with estimated completion times 10, 5, and 7 ms re-
spectively enter the ready queue together in the order P1, P2, P3. Calculate the
waiting time and turnaround time for each process and the averages.
3. Three processes P1, P2, P3 (with burst times 10, 5, and 7 ms) enter the ready
queue together. A new process P4 (burst time 2 ms) enters after 2 ms. Calculate
the waiting time and turnaround time for all using preemptive SJF scheduling. Also
compute the averages.
4. With an example, describe preemptive SJF scheduling and calculate all the perfor-
mance metrics.
2. With a block diagram, explain the embedded system development environment with
the functions of components used.
3. Mention the sequence of operations for embedding the firmware using a programmer
and draw the interfacing diagram.