Saltar al contenido

Trace, diagnose and repair algorithms

Trace in execution order

Record values after the statement or iteration named in the question. Carry unchanged values forward. Do not jump directly to the final answer: a trace table records the route taken.

Explain your choice of data structure and loop. Identify one boundary case and predict its result. For a subroutine, explain what is returned or changed in the caller.

Saved for this sitting on this browser. Review this yourself or with your teacher; these explanations are not automatically marked.

Review your explanation against these criteria
  • My types and data structure match the data and the question.
  • I justified the loop and checked its first and last iterations.
  • Initial values and rejected operations preserve the intended state.
  • My test includes input, purpose and expected result.
  • I distinguished returning a value from printing and changing caller state.

Iniciar sesión o crear cuenta

IGCSE, A-Level & AP