Viva

Lab 02 Monday brief 01

Open student defense

Assessment dossier / Lab02 Ex01: Maximum between 3 Numbers

Record 026

A final grade is an answer. Viva asks for the reasoning.

48 perfect
programs broke.

Each received full marks. Viva reran the work, found the same missing case, and turned one executable fact into a question the student has to answer.

See the evidence
01What the original grade could not seeExecutable evidence only

The evidence trail

The test suite passed.
The program still failed.

Viva only opens a defense after the submitted program and the instructor's reference disagree on one re-runnable input.

Instructor test ledgerresult
01ex01_01 2 3 3Pass
02ex01_16 2 1 6Pass
03ex01_2-1 3 1 3Pass
04Viva probe5 5 3 expected 5Diverges

One finding, all the way through

Not a prediction.
A replay.

The question comes after the run, not before it. That keeps the conversation about a precise piece of student reasoning.

01 / run

Student program

35 5 3
02 / compare

Reference program

55 5 3
03 / ask

Oral defense

?Explain the branch
02Monday morning, already mappedOne lesson, one gap
Class signal

When “greater than”
is not enough.

One bounded misconception surfaced across this exercise. The next lesson has somewhere exact to begin.

01

Comparison boundaries and ties

48 / 226
20 minute reteach
  1. Ask for the maximum of 5, 5, 3. Then replay an anonymized submission that produced 3.

  2. Trace both strict comparisons together. Name the final else branch and why it runs.

  3. Repair with a running maximum. Test all three tie positions before rerunning the original suite.

Built from the observed failure, not a generic concept tag.

Anonymized evidence / line 11

The question is not
“did you cheat?”

Viva records one bounded fact, then gives the student room to explain it. The artifact is not the verdict. Understanding is.

ex01-stu_002.cverified run
07if (a > b && a > c)
08 printf("%d\n", a);
09else if (b > a && b > c)
10 printf("%d\n", b);
11elsebranch reached on tie
12 printf("%d\n", c);