Week 12 Tutorial: Audit a complete evening
Run the final plan, trace one late or unscheduled order to its cause, and reproduce someone else's conclusion.
12 May 2027
Open Week 12 in the Lab →Try your own change on this week's case.
Two-hour tutorial: preparation, coding and checks
This week’s task#
Model: All twenty published orders and shared resources. The starting reference assignment is recomputed and checked.
Before you start · 15 minutes#
Read W12. Choose #07, #13 or #20 and predict what limits its departure.
Trace the example · 25 minutes#
Compare the greedy plan with the reference. Select an actual late or unexpected order and trace its previous task, readiness, charging and reservations.
Implement and compare · 55 minutes#
No new implementation this week. Re-run your student planner and tests, complete the record, and import an exported browser experiment in a fresh workspace to reproduce it.
Use Open full Lab for editable inputs, strategy code, exports and the practice pack. The example on this page compares this week’s published cases; your local student runner must call the functions you complete.
Check and explain · 25 minutes#
Ask another reader to recover one delivery time and its cause. Finish code, tests, checked plan, comparisons and your own explanation; keep a designed extra order in a separate scenario.
What to keep: A2: final audit, reproducible files and personal analysis. Show the tutor your prediction, experiment and explanation for this week’s participation point; keep the record to develop your assignment.
Optional extension#
Explain one untested generalisation your successful reference run cannot justify.
W12 · Trace a dinner from ready to return.
Can another person reproduce the run and trace one failure?
Audit the twenty-order evening. Choose an order to see its destination, or jump to the first late delivery.
20/20 on time. Every order delivered and every drone returned with all checks passing. The stored assignment was recomputed using this scenario.
Computed from this case · 8.93 ms · lab-1.0 · evening
Colour bands show ground elevation. The marked passage runs between two towers; its rule allows one drone at a time. Height shown at 3× scale.
Follow one dinner through the evening
- Ready7758 s
- Previous return6239
- Take-off7818
- Deliver / due8221 / 10323
Drone D; 0 s of recorded queue or airborne wait; 0 s late. Return: 8579 s.
Explore the evidence, replay or open full Lab
Open full Lab ↗ for editable inputs, strategy code and saved comparisons.
Compare the recomputed 20/20 reference with the greedy plan, then select a late order and trace its cause.
Mixed fleet; complete trips · Shared charging, FCFS · Corridor capacity one
| Inspect | Order | Drone | Load start | Deliver | Return | Late (s) | Energy (J) |
|---|---|---|---|---|---|---|---|
| #01 | A | 82 | 358 | 529 | 0 | 52958 | |
| #02 | B | 576 | 846 | 1011 | 0 | 56083 | |
| #03 | A | 1258 | 1393 | 1423 | 0 | 12529 | |
| #04 | A | 1642 | 1978 | 2209 | 0 | 76764 | |
| #05 | B | 1780 | 1946 | 2007 | 0 | 21712 | |
| #07 | C | 2606 | 2937 | 3138 | 0 | 80443 | |
| #08 | B | 2879 | 3174 | 3364 | 0 | 63728 | |
| #06 | A | 3239 | 3459 | 3574 | 0 | 43225 | |
| #10 | E | 3822 | 4144 | 4361 | 0 | 115863 | |
| #09 | A | 4180 | 4429 | 4573 | 0 | 47704 | |
| #11 | B | 4229 | 4496 | 4658 | 0 | 56437 | |
| #12 | A | 5236 | 5522 | 5703 | 0 | 62354 | |
| #13 | B | 5431 | 5693 | 5850 | 0 | 56781 | |
| #14 | D | 5438 | 5891 | 6239 | 0 | 183535 | |
| #15 | A | 6551 | 6760 | 6864 | 0 | 34477 | |
| #16 | B | 6628 | 6933 | 7133 | 0 | 60053 | |
| #17 | A | 7360 | 7541 | 7617 | 0 | 27425 | |
| #20 | D | 7758 | 8221 | 8579 | 0 | 194341 | |
| #19 | A | 8024 | 8330 | 8531 | 0 | 70019 | |
| #18 | B | 8119 | 8291 | 8358 | 0 | 22572 |
Play the recorded flight, or drag the time slider.
Time and shared resources
NowThe vertical line marks the current time; outlined intervals are active. Select an interval to jump to its start. Intervals include their start and exclude their end.
0 s 8639 s
Continue in the Lab →The same case, with every input open to change.
The spec
What you bring to the session. Written so a reader can tell whether it has been met without asking you.
- you can say why your algorithm works, when it fails, and at which level the next change belongs
- every claim in your explanation points at a run record or a test
- your late-order trace ends at a cause, not at a symptom
Teaching team
- Kofi Marchetti — tutor