cs-011 — The Dispatch Loop
| Field | Value |
|---|---|
| id | cs-011 |
| difficulty | Intermediate |
| topics | flowchart, state, termination |
| lecture | lecture-03 |
| estimated time | 5-minute attempt + 10-minute discussion |
| prerequisites | loops, lists, and tracing from lectures 1-6 |
| objective | choose the technique, trace it faithfully, and defend the boundary behaviour |
| solution | held by the instructor; discussed after the attempt |
Problem
A delivery scooter loops: take next order, deliver, return. Model it as a flowchart with a clear termination condition and what happens when orders run out mid-shift.
Your deliverable is the stated assumptions, the rule list, the decision for the worked instance, and one contested case. If the problem is ambiguous anywhere, state the assumption you are making and carry on — a stated assumption is part of a good answer.
Examples
- Input: orders [A, B, C] then shift ends; new order arrives at the last minute
- Output: A, B, C delivered, then 'shift closed' - the late order is queued for tomorrow, never processed mid-loop
Solve for the worked instance first. Then ask what would change if one number, name, or condition were replaced by something stranger.
What to notice
- Termination must be tested BEFORE taking the next order, not after delivering it.
- Writing the rules IS the solution; code is transcription.
- Every assumption is a place where two good answers can differ.
Discussion starter
After the solution is revealed, the class spends five minutes on this prompt: "Propose one extra rule that would change the verdict — is it an improvement?"
Constraints and assumptions
- Difficulty: Intermediate (loops and lists assumed).
- Topics: flowchart, state, termination.
- Classroom-scale inputs unless the problem says otherwise.
- Time-box: about five minutes for the plan and trace; finishing the details is a bonus, defending the method is the target.
- Optional stretch (not required): describe an alternative approach and say when it beats the obvious one.
Hints and extension
- First nudge: identify the pattern the worked instance uses before computing anything.
- If stuck after three minutes, write the input/output line you expect and trace the smallest example by hand.
- After the reveal, attempt the extension below before the next lecture.
- Extension challenge: Redraw the flow with one extra decision diamond and argue what changes.