Labs

Proposed full-course labs (30)

• Collaborative product brief

  Planned

  F01 · topics 1.1, 1.3

  Compare user feedback and justify an iteration.

• Input to output investigation

  Planned

  F02 · topics 1.2

  Identify purpose, input, processing and output.

• Bug clinic

  Planned

  F03 · topics 1.4

  Repair a failing program and explain a boundary test.

• Binary message studio

  Planned

  F04 · topics 2.1

  Encode and decode values and explain representation limits.

• Compression tradeoff

  Planned

  F05 · topics 2.2

  Compare full recovery with information loss.

• School transport data inquiry

  Planned

  F06 · topics 2.3, 2.4

  Clean synthetic data, compute a result and qualify the claim.

• Variable trace studio

  Planned

  F07 · topics 3.1, 3.3

  Predict and trace changing state.

• Text transformation

  Planned

  F08 · topics 3.4

  Apply a specified string interface.

• Eligibility decision

  Planned

  F09 · topics 3.5, 3.6

  Evaluate conditions and test threshold cases.

• Nested route selector

  Planned

  F10 · topics 3.7

  Find reachable decision paths.

• Loop termination detective

  Planned

  F11 · topics 3.8

  Explain state updates and termination.

• Algorithm comparison

  Planned

  F12 · topics 3.9

  Construct a counterexample or justify equivalent behavior.

• Club list filter

  Planned

  F13 · topics 3.2, 3.10

  Filter collections and explain data abstraction.

• Binary search explorer

  Planned

  F14 · topics 3.11

  Trace interval halving on sorted input.

• Procedure call tracer

  Planned

  F15 · topics 3.12

  Follow argument values and returns.

• Reusable recommendation procedure

  Planned

  F16 · topics 3.13

  Create a parameterized abstraction.

• Library documentation challenge

  Planned

  F17 · topics 3.14

  Use a supplied interface without assuming hidden behavior.

• Random outcome explorer

  Planned

  F18 · topics 3.15

  Compare possible outcomes with observed trials.

• Queue simulation

  Planned

  F19 · topics 3.16

  Test a model and explain its assumptions.

• Efficiency comparison

  Planned

  F20 · topics 3.17

  Compare operation growth as input size increases.

• Decidability case sorting

  Planned

  F21 · topics 3.18

  Distinguish difficult, decidable and undecidable claims.

• Packet journey

  Planned

  F22 · topics 4.1

  Follow a supplied packet and routing model.

• Network failure investigation

  Planned

  F23 · topics 4.2

  Analyze surviving paths and single failure points.

• Parallel task scheduler

  Planned

  F24 · topics 4.3

  Calculate time and speedup with a sequential portion.

• Innovation stakeholder inquiry

  Planned

  F25 · topics 5.1

  Explain benefits and harms for different groups.

• Digital access audit

  Planned

  F26 · topics 5.2

  Evaluate an intervention against multiple access barriers.

• Recommendation bias investigation

  Planned

  F27 · topics 5.3

  Locate a bias mechanism and test a mitigation.

• Crowdsourced accessibility map

  Planned

  F28 · topics 5.4

  Evaluate contribution quality and representation.

• Permissions and attribution clinic

  Planned

  F29 · topics 5.5

  Choose reuse under explicit license and consent conditions.

• Privacy and safe computing decisions

  Planned

  F30 · topics 5.6

  Connect a threat, safeguard and remaining limitation.