Lecture 27: The road not taken

	Lecture 1: Dr Racket and arithmetic
	Lecture 2: Definitions
	Lecture 3: Parentheses
	Lecture 4: The design recipe
	Lecture 5: Labor Day
	Lecture 6: Multiple cases
	Lecture 7: big-bang for interactive animations
	Lecture 8: Structures
	Lecture 9: More structures
	Lecture 10: Unions of structures
	Lecture 11: More points
	Lecture 12: Unlimited data
	Lecture 13: More self-reference
	Lecture 14: Built-in structures
	Lecture 15: Space invaders
	Lecture 16: Abstraction
	Lecture 17: Local definitions
	Lecture 18: Built-in abstractions
	Lecture 19: Follow the template
	Lecture 20: Mutual recursion
	Lecture 21: Simultaneous processing
	Lecture 22: Merge sort
	Lecture 23: Quick sort
	Lecture 24: Measuring and drawing curves
	Lecture 25: Accumulators
	Lecture 26: Route finding
	Lecture 27: The road not taken
	Lecture 28: Designing a neuron
	Lecture 29: Neural networks
	Lecture 30: How long does it take?

8.6.0.14

This assignment is due on Sunday, November 27 at 11:59pm. Submit it using Handin as assignment lecture27.

Exercise 1. Write a shorter example Map, not using USA, that also doesn’t finish. Define it as a constant named loop-map.

Exercise 2. Change generate-way-tree to use generate-way-tree/a.

Exercise 3. Finish designing has-route?, using the functions we’ve already defined.