G12 SUPER GIO
123
01
LEARN MISSIONdecomposition, algorithms, data, testing, and iteration

decomposition, algorithms, data, testing, and iteration

WORKED SOURCEWORKED SOURCE

Trace a scheduling algorithm

Jobs: A duration 3 deadline 4, B duration 2 deadline 8, C duration 1 deadline 3. Earliest-deadline order C,A,B completes at 1,4,6.

  1. Check completion against deadlines.
  2. Trace the worked reasoning before selecting the conclusion.

Does the order meet all deadlines?

MODELAlgorithm Build Board
BUILD
PROVEChoose with evidence
CLUE

Pause. Find what matters. Then make your move.