ACARA Digital Technologies Years 9–10 Word Scramble: Algorithms with Logical Operators and Testing and Validating Programs (Modules 536–590)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
ETST TDAA
Values chosen so each part of a compound condition is TRUE and FALSE in turn, including boundaries like 17, 18 and 19 for Age >= 18, so every path gets tested.
2
ITAAELDV A RPMGORA
To prove a program gives the correct output for its problem by running or tracing it against test cases. Running without errors is not proof; it is only as validated as its tests.
3
XTEECDEP UUOPTT
The correct result of a test case, worked out by hand from the specification before running the code. Never copy it from the program's own output, or the test proves nothing.
4
DEEG SEAC
An unusual but allowed input, such as an empty list, a one-item list, repeated values, or the maximum at the start or end, that you test because it can break code.
5
UHTRT LBEAT
A table listing every True/False combination of the parts in an and/or/not condition. Use it to pick test inputs that make each part True and False, then check each result.
6
STET EVRECAGO
Testing so that every if/elif/else branch runs at least once and every loop is tried running zero times, once and many times. Any code never run is untested.
7
CETRA A RLFWTHOCA
Follow a flowchart from Start to Stop using test values, noting each diamond's Yes or No answer in a trace table and following loop arrows back until Stop.
8
RCAET SV UPTUTO
Run the code with the same input you traced, then compare. If the real output differs from your trace, either the trace or the code has a mistake, so re-trace.
9
ESTT AETLB
A table with one row per test case. Its columns are test number, purpose, input, expected result, actual result and pass or fail.
10
ASSP RO LAIF
Copy the actual result exactly as the program gave it, then mark Pass only if it matches the expected result, otherwise Fail. Never change the expected result to fit, and add a note for fails.
Answer Key
ACARA Digital Technologies Years 9–10 · Modules 536–590
1ETST TDAA → test data — Values chosen so each part of a compound condition is TRUE and FALSE in turn, including boundaries like 17, 18 and 19 for Age >= 18, so every path gets tested.
2ITAAELDV A RPMGORA → validate a program — To prove a program gives the correct output for its problem by running or tracing it against test cases. Running without errors is not proof; it is only as validated as its tests.
3XTEECDEP UUOPTT → expected output — The correct result of a test case, worked out by hand from the specification before running the code. Never copy it from the program's own output, or the test proves nothing.
4DEEG SEAC → edge case — An unusual but allowed input, such as an empty list, a one-item list, repeated values, or the maximum at the start or end, that you test because it can break code.
5UHTRT LBEAT → truth table — A table listing every True/False combination of the parts in an and/or/not condition. Use it to pick test inputs that make each part True and False, then check each result.
6STET EVRECAGO → test coverage — Testing so that every if/elif/else branch runs at least once and every loop is tried running zero times, once and many times. Any code never run is untested.
7CETRA A RLFWTHOCA → trace a flowchart — Follow a flowchart from Start to Stop using test values, noting each diamond's Yes or No answer in a trace table and following loop arrows back until Stop.
8RCAET SV UPTUTO → trace vs output — Run the code with the same input you traced, then compare. If the real output differs from your trace, either the trace or the code has a mistake, so re-trace.
9ESTT AETLB → test table — A table with one row per test case. Its columns are test number, purpose, input, expected result, actual result and pass or fail.
10ASSP RO LAIF → Pass or Fail — Copy the actual result exactly as the program gave it, then mark Pass only if it matches the expected result, otherwise Fail. Never change the expected result to fit, and add a note for fails.