This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS170 Problem Set 4 Out: Feb 10, 2010 Due: Feb 19, 2010, 4pm 1. DPV 3.2, 3.3 2. DPV 3.4 (just draw the graphs labeled with the requested information) 3. DPV 3.8, 3.12, 3.26 4. Toy Train. A precocious 4-year-old M likes to play with her toy trains. There are 4 kinds of track pieces that can be connected (for convenience, each place a track piece can connect to another is labeled as in the figure below): (a) straight pieces (one end is labeled A and the other B), (b) curved pieces (one end is labeled A and the other B), (c) Y-connectors, where if you enter at C, you can exit either at D or E, and if you enter at D or E, you must exit at C (d) T-connectors, where no matter where you enter (say F), you can exit at either of the other two places (G or H) After building lots of different train tracks, M realizes not all are equally fun to play with: On some tracks you can keep moving the train forward as long as you like without running out of track, and on some you can’t. On some you can get to any track piece from any other track piece by moving the train in its forward direction. On some you can even get the train to face in either direction on any track piece just by moving forward (see Track A below, where Train 1 can get to the same position as Train 2). In some(see Track A below, where Train 1 can get to the same position as Train 2)....
View Full Document
- Spring '02
- Algorithms, track piece