The sender task will be blocked permanently
The queue will eventually be full, and the sender task will be blocked until space is available
The queue will clear automatically, allowing the sender to continue
The system will crash due to queue overflow
Consider a finite state machine (FSM) controlling a motor speed system with a single button. The states and events are defined as follows:
STATE_STOPPED
STATE_FAST
STATE_OVERSPEED
STATE_SLOW
What is the main issue caused by priority inversion in an RTOS?
High-priority tasks being blocked by low-priority tasks holding a shared resource
Low-priority tasks consuming all CPU time
Tasks executing in an unpredictable order
RTOS scheduler failing to schedule tasks correctly
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Embedded C Programming (Embedded C Programming) End Term paper sat on 13 Apr 2025, in the January 2025 term, set QEF3: 21 questions for 52 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Embedded C Programming End Term 13 Apr 2025 Set QEF3 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | Embedded C Programming |
| Course code | CS2101 |
| Questions | 21 |
| Marks | 52 |
| Duration | 180 min |
| MCQ | 20 |
| Numerical | 1 |
| Official paper | IIT M ES FOUNDATION AN EXAM QEF3 13 Apr 2025 |
| Negative marking | No negative marking. |
| Updated |
