Real-Time Software Engineering — Study Pack

A practice paper laid out by the 5 topics, mixing short answer · identify · MUTEX tracing · policy sketching · ST2/ST4 analysis. Auto-graded with worked solutions & Gantt charts. ⚠️ Unofficial — a student's prediction of emphasis, not the real paper.

~124 multiple-choice questions, tabbed per chapter, covering all 42 subchapters. Instant feedback, explanations, live score. Best for recognition.

18 activities: sort into buckets, match term↔definition, order sequences. Best for relationships & procedures.

Drag each item into the list it belongs to (mechanisms vs requirements, services vs structure…). Chips shuffle each time. Fixes “which enumeration?” mix-ups.

Recall the syllabus map: list every subchapter of a chapter, then name the subchapter from its idea. Remembering the structure is half the battle.

Given the meaning, type the term; plus 22 list-completions (name the 6 problems, 4 MUTEX requirements, 5 RTOS services…). Closest to the exam.

The reverse & the most complete recall: ~60 concepts across every chapter — write the explanation, graded on the key ideas you hit, with the model answer shown.

Fill the comparison tables cell-by-cell (Concurrency vs Parallelism, RM vs EDF, RTOS vs GPOS…) — recall each aspect for both sides.

Type the code: BACI semaphores (p(s)/v(s)), C mutexes, µC/OS-II kernel calls, Java/OCCAM/Ada constructs.

List the advantages & disadvantages of each approach (the four scheduling classes from the slides, RM/EDF, RTOS, threads…).

Random task set every round — YOU compute U, the RM bound + verdict, and WCRT via RTA. Auto-checked, with the full worked steps on reveal.

Random RM schedule — answer who runs at t=?, does a task miss its deadline, how many idle ticks. Reveals the actual Gantt chart.

Fill the blanks in the Ch 9 formulas — RM/EDF bounds, workload Wᵢ(t), the RTA recurrence. For the “write the formula” marks.

Read a scenario, name which of the 6 concurrency problems it is (deadlock / starvation / race…). Mirrors the Ch 5 slide “Group Quiz”.

Live schedulability calculator — edit periods/WCETs and watch utilization, RM bound & response-time analysis recompute instantly.

Schedule simulator — build the Gantt timeline for FCFS, Round-Robin, fixed-priority, RM & EDF, with preemption, deadlines & misses.

Concurrency explorer — run threads over shared vars and see every interleaving, the count, and how many distinct outputs (race conditions).

Full theory, chapter → sub-topic, with a clickable table of contents. Your main learning pass.

Fast cram sheet: comparison tables, formulas, and the two scheduling worked examples.

The "know-how": step-by-step calculations, timelines, tracing, code — the non-memorisation parts.

Past-paper analysis: which topics + where you need definition vs derive vs calculate (not a prediction).