Answear sheet - Backtracking Test


Each question is worth 1p
  1. Question 1: A systematic search technique (a)
  2. Question 2: The N queens problem (b)
  3. Question 3: Combinatorial optimization problems (c)
  4. Question 4: Reversion to the previous state (c)
  5. Question 5: Eliminating impossible solutions (a)
  6. Question 6: Be consistent with all constraints (a)
  7. Question 7: Find all possible solutions (a)
  8. Question 8: The partial solution is marked as invalid and we return to the previous step (b)
  9. Question 9: Sudoku (c)
  10. Question 10: An empty partial solution (b)