50 likes | 161 Views
Pair Programming Workshop. Pair Programming Review. 1 pair per computer Negotiate interactions (to some degree) 1 person “drives,” the other “observes” After some amount of time, trade places Talk a lot. How-to. 1 st agree on a solution Agree on one tiny goal at a time Drivers:
E N D
Pair Programming Review • 1 pair per computer • Negotiate interactions (to some degree) • 1 person “drives,” the other “observes” • After some amount of time, trade places • Talk a lot
How-to • 1st agree on a solution • Agree on one tiny goal at a time • Drivers: • Complete the current tiny goal first as quickly as possible • Rely on observer as your safety net • Generally write tests first
How-to • Observers • Code review as its written • Consider bugs, test cases, structural issues, potential interface conflicts, possible simplifications, etc. • Point out bugs and errors right away • For larger issues, jot down notes and talk about after the tiny goal is done • Don’t talk in code
Today’s Task: Sling Blade Runner • Problem: "How long a chain of overlapping movie titles, like Sling Blade Runner, can you find?" • Multi-word overlaps, as in "License to Kill a Mockingbird," are allowed. The same title may not be used more than once in a solution. Heuristic solutions are allowed. • Data provided by MovieLens at the University of Minnesota.