What is the main challenge of the capstone?
- A.Inventing a new pathfinding algorithm
- B.Integrating components you already built so they work together as one system
- C.Building a new robot from parts
- D.Rewriting BFS from scratch
Answer Why?
What single data structure connects the start of the run, pathfinding, detection, and what you carry into the next run?
- A.The distance dictionary
- B.The blocked list — filled at the start, planned from, added to on detection, then printed at the end
- C.The to_visit list
- D.The heading number
Answer Why?
Why can the program print the plan for leg 1 before the button, but not for legs 2 to 4?
- A.compute_bfs_path only works once per program
- B.Later legs are planned from wherever leg 1 actually ends, with whatever obstacles were found on the way — neither is known yet
- C.Printing more than one path would overflow the screen
- D.The button only allows one print
Answer Why?
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?
- A.The rangefinder threshold is too low
- B.They called navigate_with_detection() without assigning its returned position and heading, so leg 2 was planned from the starting point
- C.BFS found a non-shortest path
- D.The destinations list is too long
Answer Why?
Which is a classic capstone integration bug to watch for?
- A.Using too few comments
- B.Resetting the blocked list between destinations, so the robot forgets obstacles mid-run
- C.Naming the robot
- D.Printing the path
Answer Why?
In the demo, what evidence shows the robot 'learned'?
- A.It drives faster
- B.Run 2 has fewer reroutes and/or fewer steps than Run 1, because it started out knowing where the obstacles were
- C.It makes a sound at each intersection
- D.Run 2 visits fewer destinations
Answer Why?