Using Trace Tables

A trace table is a technique used to test an algorithm and predict step by step how the computer will run the algorithm. It can be used to understand or predict what an algorithm is doing and to identify potential logic errors (when the program compiles but does not produce the expected output).

The animation below demonstrate the use of a trace table used to track the values of variables as they change while the program is running.

Using a trace table to test an algorithm is called dry run testing.

Your Task

i = 0
j = 10

WHILE i < j
   i = i + 1
   j = j - 1
END WHILE

OUTPUT(i)
OUTPUT(j)

number = 5
factorial = number

WHILE number>2
   number = number - 1
   factorial = factorial * number
END WHILE

OUTPUT(factorial)

FOR i FROM 1 TO 20
   IF i MOD 3 == 0 AND i MOD 5 == 0 THEN
      OUTPUT "Fizz-Buzz"
   ELSE IF i MOD 3 == 0 THEN
      OUTPUT "Fizz"
   ELSE IF i MOD 5 == 0 THEN
      OUTPUT "Buzz"
   ELSE
      OUTPUT i
   END IF
NEXT i

OUTPUT("The End")

FUNCTION max(a, b)
   IF a>b THEN
      RETURN a
   ELSE 
      RETURN b
   END IF
END FUNCTION

number1 = 7
number2 = 12
number3 = max(number1, number2)
OUTPUT(number3)