Skip to main content
Module 5 · Pathfinding Around Obstacles

Lesson 5-9 · Capstone Project — Knowledge Checks

Name Date
  1. What is the main challenge of the capstone?

    1. A.Inventing a new pathfinding algorithm
    2. B.Integrating components you already built so they work together as one system
    3. C.Building a new robot from parts
    4. D.Rewriting BFS from scratch

    Answer Why?

  2. What single data structure connects the start of the run, pathfinding, detection, and what you carry into the next run?

    1. A.The distance dictionary
    2. B.The blocked list — filled at the start, planned from, added to on detection, then printed at the end
    3. C.The to_visit list
    4. D.The heading number

    Answer Why?

  3. Why can the program print the plan for leg 1 before the button, but not for legs 2 to 4?

    1. A.compute_bfs_path only works once per program
    2. B.Later legs are planned from wherever leg 1 actually ends, with whatever obstacles were found on the way — neither is known yet
    3. C.Printing more than one path would overflow the screen
    4. D.The button only allows one print

    Answer Why?

  4. A team's robot drives leg 1 correctly, then on leg 2 turns the wrong way and tracks off the grid. The most likely cause?

    1. A.The rangefinder threshold is too low
    2. B.They called navigate_with_detection() without assigning its returned position and heading, so leg 2 was planned from the starting point
    3. C.BFS found a non-shortest path
    4. D.The destinations list is too long

    Answer Why?

  5. Which is a classic capstone integration bug to watch for?

    1. A.Using too few comments
    2. B.Resetting the blocked list between destinations, so the robot forgets obstacles mid-run
    3. C.Naming the robot
    4. D.Printing the path

    Answer Why?

  6. In the demo, what evidence shows the robot 'learned'?

    1. A.It drives faster
    2. B.Run 2 has fewer reroutes and/or fewer steps than Run 1, because it started out knowing where the obstacles were
    3. C.It makes a sound at each intersection
    4. D.Run 2 visits fewer destinations

    Answer Why?