Quantitative Reasoning

Handouts

Date	Handout
1/25/10	Lecture notes
2/1/10	Lecture notes Assessment
2/8/10	Lecture notes Things to know for Test 1 Euler circuits • Does an Euler circuit exist? • Find it! • Eulerize a circuit Hamiltonian circuits • Nearest neighbor algorithm • Sorted edges algorithm Spanning trees • Kruskal’s algorithm Digraphs • Critical paths Bin packing algorithms • Next fit & next fit decreasing • First fit & first fit decreasing
2/22/10	Lecture notes
3/1/10	Lecture notes
3/15/10	Lecture notes Midterm study guide Answers to page 95 HW Answers to page 90 HW Answers to page 308 HW
3/22/10	Lecture notes
3/29/10	Lecture notes
4/5/10	Lecture notes
4/12/10	Lecture notes
4/19/10	Lecture notes
4/26/10
5/3/10

Date Assigned	Date Due	Reading	HW to hand in	HW for your use
1/25/10	2/1/10	Chapters 1 and 2	p.22: 4,6,26; p. 54: 38,40,50	p.20:1-8,11-13,17;p.52:1-7,15,17; p.54:39,53a
2/1/10	2/8/10		p. 63:70,72,74; also find a Hamiltonian circuit using the nearest neighbor (starting at Boston) and sorted edges algorithms for the following cities and distances: Boston-NYC: 24 miles; Boston-Washington, DC:400 miles; Boston-Philadelphia: 300 miles: NYC-DC: 200 miles; NYC-Phila: 90 miles; DC-Phila: 160 miles.	P.63:71,73; p.89:2,3,4
2/8/20	2/22/10	Chapter 3	Page 95: 38bd,48,49,50,62 Page 90: 14,15,16
2/22/10		Chapter 9	Extra credit: page 308: problem 4
3/1/10	3/15/10		P.308:10, 12, 14, 17, 35, 36.	P.307:1, 2, 6, 11, 12, 15, 17
3/15/10	3/22/10	Chapter 11	Page 363: 3,4,14	Skills check on p.362:1,2,3,4,10,11,16
3/22/10	3/29/10	Chapter 13	Page 429:22,23	Skills check on p.425
3/29/10	4/5/10		Page 427: 1,2,4,11,12
4/5/10	4/12/10	Chapter 15	This sheet; page 502:1,2,3,4,5
4/12/10	4/19/10	Chapter 16	Page 527: 4, 9,15,16	Extra credit:
4/19/10	4/26/10	Chapter 17	Page 527: 2,12,21,25,50, plus this sheet	Page 526: 2,3,4,13,14