Software Engineering › Learn step by step › Y11 Programming Fundamentals
Item 63 of 426 · Year 11: Programming Fundamentals, 17 of 69
Backtracking
Term Key terms bank
Jump to a topic
- Exam format, question types and command words (46)
- Year 11: Programming Fundamentals (69)
- Year 11: The Object-Oriented Paradigm (33)
- Year 11: Programming Mechatronics (29)
- Year 12: Secure Software Architecture (57)
- Year 12: Programming for the Web (59)
- Year 12: Software Automation (35)
- Year 12: The Software Engineering Project (47)
- Diagrams and modelling tools (18)
- Python, SQL, pseudocode and CSS patterns (33)
Definition
Trying one choice and, if it reaches a dead end, undoing it and trying the next, as in maze solving or Sudoku.
Example: A maze solver backtracks to the last junction when it hits a wall.
Found in: syllabus.
Try an option, retreat on a dead end, try another.
Where you'll use it in the test
Syllabus area: Y11 Programming Fundamentals.
Question types it can appear in
- Multiple choice: Pick the option that matches the definition or example.
- Fill in the blanks: Choose this term to complete a statement or table.
- Short answer: Define, outline or explain it and tie it to the scenario.
How to use it
A model sentence
“Trying one choice and, if it reaches a dead end, undoing it and trying the next, as in maze solving or Sudoku.” Then apply it: A maze solver backtracks to the last junction when it hits a wall.
In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.
Command words used with it
No linked question shows the command word for this term. Across the past short answer questions in this bank the words used most are: Explain, Outline, Describe, Compare, Classify, Analyse. Check the actual word in your question.
Go deeper
- Flashcard: Backtracking in Programming Fundamentals (Year 11) · study that set
- Memorise: Software development steps and algorithm design
- Key terms bank entry: Backtracking
- Notes: Software development steps and algorithm design (Year 11 content (Programming fundamentals, OOP, Mechatronics))
- Full term page: every question, note and marking comment for Backtracking
Check yourself
Explain “Backtracking” in one sentence, give an example, and name a question type that could test it.
Reveal the answer
Trying one choice and, if it reaches a dead end, undoing it and trying the next, as in maze solving or Sudoku.
Example: A maze solver backtracks to the last junction when it hits a wall.
Could be tested as: Multiple choice, Fill in the blanks, Short answer.