ECT426 — REAL TIME OPERATING SYSTEMS
Question Bank
KTU 2019 Scheme | S8 [Link] ECE
Source Papers: June 2023 | October 2023 | May 2024 | August 2024 | April 2025 | September 2025 | May
2019 (EC366)
Legend: [Repeated Nx] High-priority repeated question [Numerical] Calculation/schedule required [X marks]
Mark allocation
Most Repeated Questions — Study These First
1. Types of operating systems (explain 3–4 types) — Repeated 5×
2. FreeRTOS features — Repeated 5×
3. RTLinux features/applications — Repeated 5×
4. Classification of real time tasks based on deadline — Repeated 5×
5. Draw/explain process control block (PCB) — Repeated 4×
6. Draw/explain process state transition diagram — Repeated 4×
7. Kernel importance and services — Repeated 4×
8. OS functions from user side — Repeated 4×
9. Five-state process transition diagram — Repeated 4×
10. Semaphore types (with state diagrams) — Repeated 5×
11. Adaptive Cruise Control RTOS system — Repeated 4×
12. MicroC/OS-II IPC techniques — Repeated 4×
13. Multilevel feedback queue scheduling — Repeated 5×
14. Rate Monotonic scheduling (numerical) — Repeated 3×
15. LDF scheduling (numerical) — Repeated 3×
16. EDD algorithm — Repeated 3×
17. Deadline Monotonic scheduling with example — Repeated 3×
18. EDF with precedence constraints (numerical) — Repeated 3×
19. Message queue (parameters and data structures) — Repeated 4×
Module 1
Module 1 — Operating System Concepts, Kernel & Process Management
Part A — Short Answer Questions (3 marks each)
1. Define the operating system and list/explain its objectives. [Repeated 4x] [3 marks]
2. Draw the process state transition diagram and explain. [Repeated 4x] [3 marks]
3. Draw/explain the structure of a process control block (PCB). [Repeated 4x] [3 marks]
4. Define process. Illustrate the structure of a process in memory. [Repeated 3x] [3 marks]
5. Explain the functions of an operating system. [Repeated 3x] [3 marks]
6. List any three types of operating systems with an example. [Repeated 2x] [3 marks]
7. What are the services offered by kernel in an operating system? [Repeated 2x] [3 marks]
8. What is a zombie process in an operating system? [3 marks]
Part B — Long Answer Questions (4–14 marks each)
1. Explain any three/four types of operating systems in detail. [Repeated 5x] [9 marks]
2. Mention the importance of kernel in an OS. Explain the main services offered by kernel. [Repeated 4x] [6
marks]
3. Draw and explain the structure of a process control block (PCB) in an operating system. [Repeated 4x] [7
marks]
4. Explain the functions of operating system as viewed from the user side. [Repeated 4x] [7 marks]
5. Draw and explain the five-state process state transition diagram. [Repeated 4x] [8 marks]
6. Explain any four functions provided by OS services for the user. [Repeated 2x] [8 marks]
7. List the information stored in a process control block. [Repeated 2x] [6 marks]
8. Explain process state model in detail with diagrams. [Repeated 2x] [8 marks]
9. Explain any two functions of operating system kernel in detail. [6 marks]
10. Explain any five functions of operating systems. [5 marks]
11. Describe the virtual machine structure of operating system design. [8 marks]
12. Explain the monolithic and layered architecture of operating systems. [12 marks]
Module 2
Module 2 — CPU Scheduling & Multithreading
Part A — Short Answer Questions (3 marks each)
1. Describe the features of multilevel feedback queue scheduling algorithm. [Repeated 3x] [3 marks]
2. List the problems associated with multi-process/multiprocessor scheduling. How can they be solved?
[Repeated 3x] [3 marks]
3. Define any three criteria for comparing scheduling algorithms. [Repeated 3x] [3 marks]
4. Differentiate Pre-emptive and Non Pre-emptive Scheduling schemes. [Repeated 2x] [3 marks]
5. Explain the different multithreading models. [Repeated 2x] [3 marks]
6. What is meant by starvation in process scheduling? [Repeated 2x] [3 marks]
7. List the difference between thread and process. [Repeated 2x] [3 marks]
8. List any three scheduling criteria. [Repeated 2x] [3 marks]
9. What is processor affinity? [Repeated 2x] [3 marks]
10. Define context switching. [3 marks]
Part B — Long Answer Questions (4–14 marks each)
1. Explain multilevel feedback queue scheduling with an example. [Repeated 5x] [6 marks]
2. Explain multilevel queue scheduling algorithm with an example. [Repeated 3x] [6 marks]
3. Explain the concept of multithreading and its advantages. [Repeated 3x] [8 marks]
4. Compare process and thread. Explain user and kernel level threads. [Repeated 3x] [7 marks]
5. [NUMERICAL] Schedule processes P1(burst 10, pri 2), P2(13, pri 3), P3(20, pri 1), P4(7, pri 4) with SJF
and Round Robin. Compare performances. [Repeated 3x] [Numerical] [8 marks]
6. [NUMERICAL] Schedule P1(7), P2(12), P3(5), P4(7) using Round Robin (TQ=3ms). Calculate avg waiting
time and turnaround time. Compare with priority scheduling. [Repeated 2x] [Numerical] [10 marks]
7. [NUMERICAL] P1, P2, P3 (burst 4, 6, 5 ms; priorities 1, 0, 3). P4 (burst 6ms, priority 2) arrives at 5ms.
Non-preemptive priority scheduling — find waiting time and TAT for each. [Repeated 2x] [Numerical] [8 marks]
8. Differentiate process and thread. Explain multithreading models. [Repeated 2x] [7 marks]
9. Explain Shortest Remaining Time Next (SRTN) scheduling algorithm with an example. [Repeated 2x] [7 marks]
10. Illustrate the different levels of scheduling in a system with a neat diagram. [Repeated 2x] [6 marks]
11. [NUMERICAL] Schedule P1(0,5), P2(1,4), P3(2,2), P4(4,1) with Round Robin (TQ=2). Gantt chart, avg
waiting time and turnaround time. [Repeated 2x] [Numerical] [10 marks]
12. [NUMERICAL] Schedule P1(0,5), P2(1,3), P3(2,4), P4(4,1) with SJF preemptive. Gantt chart, avg waiting
time, TAT, response time. [Repeated 2x] [Numerical] [10 marks]
13. [NUMERICAL] Compare SJF and SRTF for P1(1ms), P2(4ms), P3(2ms), P4(6ms), P5(3ms) arriving in
order P4,P2,P5,P1,P3 with 1ms intervals. [Numerical] [10 marks]
14. [NUMERICAL] Schedule P1(0,7), P2(1,5), P3(3,2), P4(4,3) with preemptive SJF. Gantt chart, avg waiting
time, TAT. [Numerical] [8 marks]
15. [NUMERICAL] Round Robin for P1(0,10), P2(1,5), P3(3,2), P4(4,3), TQ=3ms. Gantt chart, avg waiting
time, TAT. [Numerical] [8 marks]
16. Explain single-threaded and multi-threaded processes. [4 marks]
17. What is load balancing in symmetric multiprocessing systems? What are the techniques? [6 marks]
18. Compare FCFS and Round Robin Scheduling algorithms. [4 marks]
19. [NUMERICAL] Schedule P1(8,pri3), P2(5,pri1), P3(2,pri4), P4(4,pri2), P5(3,pri3) using SJF and Priority.
Compare performances. [Numerical] [10 marks]
Module 3
Module 3 — RTOS Concepts, Semaphores, IPC & Exceptions
Part A — Short Answer Questions (3 marks each)
1. Explain suspended, pended and delayed tasks. [Repeated 3x] [3 marks]
2. Define exception. Explain the different classes of exceptions. [Repeated 3x] [3 marks]
3. Define real-time system. List three characteristics of an RTOS. [Repeated 2x] [3 marks]
4. Define a semaphore. Explain its structure. [Repeated 2x] [3 marks]
5. Differentiate between signal and a normal interrupt. [Repeated 2x] [3 marks]
6. Write the differences between message queues and pipes. [Repeated 2x] [3 marks]
7. Explain about the structure of RTOS. [Repeated 2x] [3 marks]
8. What is an event register? Explain. [Repeated 2x] [3 marks]
9. Explain different types of RTOS based on deadline. [Repeated 2x] [3 marks]
10. What is meant by nested exceptions and stack overflow? [3 marks]
Part B — Long Answer Questions (4–14 marks each)
1. Explain the different types of semaphores used in a real time system (with state diagrams). [Repeated 5x] [8
marks]
2. Draw the structure and explain the characteristics of a Real Time Operating System with an example.
[Repeated 4x] [7 marks]
3. Define message queue. Illustrate its associated parameters and supporting data structures. [Repeated 4x] [9
marks]
4. What is priority inversion? What are the techniques used to avoid it? [Repeated 3x] [5 marks]
5. Explain how exceptions and interrupts help in designing an embedded system. [Repeated 3x] [6 marks]
6. Describe any two inter-task communication mechanisms used in RTOS with relevant diagrams. [Repeated
2x] [8 marks]
7. Define exceptions and interrupts. List three areas of application of exceptions and interrupts. [Repeated 2x] [5
marks]
8. Draw the detailed task state diagram and explain. [Repeated 2x] [7 marks]
9. Explain the operation of a message queue with relevant diagrams. [Repeated 2x] [7 marks]
10. Explain message queue and pipe inter-task communication mechanisms. List two differences between
them. [Repeated 2x] [10 marks]
11. Explain the characteristics of a Real Time Operating System with an example. [Repeated 2x] [7 marks]
12. Explain about various states of a task. [Repeated 2x] [7 marks]
13. What is an exception? Compare exception and interrupt. [Repeated 2x] [7 marks]
14. Explain semaphore message queue. Illustrate its parameters and supporting data structures. [9 marks]
15. Explain how event registers help inter-process communications in RTOS. [4 marks]
16. Explain semaphores and its associated data structures. Explain different types of semaphores. [10 marks]
17. What are the key characteristics of RTOS? Explain. [5 marks]
Module 4
Module 4 — Real Time Scheduling Algorithms
Part A — Short Answer Questions (3 marks each)
1. Explain the classification of real time tasks based on deadline. [Repeated 5x] [3 marks]
2. State Jackson's algorithm for real time scheduling. Illustrate with an example. [Repeated 3x] [3 marks]
3. Compare rate monotonic with deadline monotonic periodic task scheduling. [Repeated 2x] [3 marks]
4. Explain EDD CPU scheduling algorithm. [Repeated 2x] [3 marks]
5. Explain the precedence constraints in a real time task with an example. [Repeated 2x] [3 marks]
6. Draw the minimum state transition diagram of a real-time kernel. [Repeated 2x] [3 marks]
7. Write Horn's theorem for scheduling aperiodic tasks in RTOS. [3 marks]
8. Explain LDF scheduling algorithm. [3 marks]
Part B — Long Answer Questions (4–14 marks each)
1. [NUMERICAL] Construct the schedule graphically based on LDF for: J1(C=3,D=5), J2(4,8), J3(2,11),
J4(3,12), J5(3,15), J6(2,20), J7(2,19), J8(1,18) with given precedence graph. [Repeated 3x] [Numerical] [10
marks]
2. [NUMERICAL] EDF scheduling with aperiodic tasks and precedence A→B,A→C,B→D,B→E,C→F. Task
parameters: A(C=2,d=4,r=0), B(2,10,1), C(2,8,1), D(2,6,3), E(2,10,7), F(1,12,9). Schedule with EDF
releasing tasks after predecessors finish. [Repeated 3x] [Numerical] [5 marks]
3. [NUMERICAL] Verify schedulability and construct Rate Monotonic schedule for T1(C=0.5,T=3), T2(1,4),
T3(2,6). [Repeated 3x] [Numerical] [10 marks]
4. Differentiate between Rate Monotonic and Deadline Monotonic algorithm. [Repeated 3x] [4 marks]
5. Explain the timing constraints of a Real Time Operating System. [Repeated 3x] [7 marks]
6. Explain EDD algorithm with an example. [Repeated 3x] [4 marks]
7. List the performance measures of a real time scheduling algorithm. [Repeated 2x] [7 marks]
8. Compare periodic and aperiodic tasks. [Repeated 3x] [4 marks]
9. [NUMERICAL] EDF with/without precedence constraints for J1(C=2,d=3,r=0), J2(2,10,1), J3(2,8,1),
J4(3,6,3), J5(2,12,6) with J1→J2, J1→J3, J2→J4, J2→J5. [Repeated 2x] [Numerical] [10 marks]
10. Explain Deadline Monotonic scheduling algorithm with an example. [Repeated 3x] [7 marks]
11. With a neat diagram explain the structure of a real time kernel. [Repeated 2x] [7 marks]
12. Explain EDF with precedence constraints scheduling algorithm. [Repeated 2x] [8 marks]
13. Draw the detailed process state transition diagram and explain each state. [Repeated 2x] [9 marks]
14. Explain different types of task constraints in RTOS. [6 marks]
15. [NUMERICAL] LDF schedule for J1-J6 with precedence J1→J2, J2→J4, J2→J5, J1→J3, J3→J6. All
completion time=1. Deadlines: J1(2), J2(5), J3(4), J4(3), J5(5), J6(6). Find max lateness. [Numerical] [8
marks]
16. [NUMERICAL] EDF with precedence for 7 tasks A–G: A→C, B→C, B→D, C→E, C→F, D→F, D→G. All
arrive t=0, deadline=25, computation: 2,3,3,5,1,2,5. Modify arrival times and deadlines. [Numerical] [9 marks]
17. [NUMERICAL] EDF without precedence for J1-J5: arrivals(0,0,2,3,6), completions(1,2,2,2,2),
deadlines(2,5,4,10,9). Find max lateness. [Numerical] [5 marks]
18. [NUMERICAL] Rate Monotonic schedule for T1(C=3,T=20), T2(2,5), T3(2,10). [Numerical] [8 marks]
19. Explain the Earliest Deadline First (EDF) scheduling algorithm with an example. [8 marks]
20. Explain the precedence constraints of a real-time task. [6 marks]
21. Draw and explain the structure and functions of a real time kernel. [6 marks]
Module 5
Module 5 — Commercial RTOS: FreeRTOS, MicroC/OS-II, RTLinux, pSOS & Applications
Part A — Short Answer Questions (3 marks each)
1. List any three features of FreeRTOS. / Explain any 3 features of FreeRTOS. [Repeated 4x] [3 marks]
2. List any three applications of RTLinux. / Explain the applications of RTLinux. [Repeated 4x] [3 marks]
3. Compare the features of pSOS and VTRX. [Repeated 3x] [3 marks]
4. List the heap implementation schemes used in FreeRTOS. Mention the functions of each. [Repeated 3x] [3
marks]
5. Discuss any three functions used in MicroC/OS-II for the scheduling operation. [Repeated 2x] [3 marks]
6. Illustrate the threads in MicroC/OS-II operating system. [3 marks]
7. List the features of VRTX. [3 marks]
8. List three applications of pSOS and three applications of RTLinux. [3 marks]
Part B — Long Answer Questions (4–14 marks each)
1. Explain any four features of FreeRTOS. [Repeated 5x] [7 marks]
2. Explain the features of RTLinux RTOS. [Repeated 5x] [5 marks]
3. With a suitable requirement table and block diagram, explain the RTOS used in an adaptive cruise control
system. [Repeated 4x] [10 marks]
4. Explain the inter-process communication techniques used in MicroC/OS-II. [Repeated 4x] [7 marks]
5. Illustrate the implementation of a real-time system with an example. [Repeated 3x] [8 marks]
6. Explain the synchronization techniques / mutual exclusion and task synchronization in MicroC/OS-II.
[Repeated 3x] [8 marks]
7. Explain the functions of an Adaptive Cruise Control System in a car with a block diagram. [Repeated 3x] [8
marks]
8. List three features and three applications of pSOS. [Repeated 2x] [6 marks]
9. List six features of Linux in its scheduling system. [Repeated 2x] [6 marks]
10. Write the prototype of MicroC/OS-II (MUCOS) service function to create a task. List parameters passed
and returned. [Repeated 2x] [8 marks]
11. Explain the RTOS control system used in adaptive cruise control (May 2024 version). [Repeated 2x] [10
marks]
12. Explain the features of pSOS. [Repeated 2x] [6 marks]
13. Explain the features of Linux. [6 marks]
14. List the features of FreeRTOS. [4 marks]
15. Explain the various inter-process communication techniques supported by VxWorks and MicroC/OS. [12
marks]
16. Explain how μC/OS-II handles the critical section of code. [8 marks]
17. Using a block diagram explain how a real time system is implemented. Describe a real life example of an
RTOS control system. [10 marks]