Algorithms Homework Assignments
- HW 1: Due Wednesday, September 18, 1996.
- 600.363: 1.3-3, 1-3, 2-3, 3.2-4, 4-1
- 600.463: 1-3, 2-3, 3.2-4, 4-1, 4-3
- HW 2: Due Wednesday, September 25, 1996.
- 600.363: 7.5-3, 7.5-6, 8.2-2, 8-3
- 600.463: 7.5-6, 8.2-2, 8-3, 8-4
- HW 3: Due Wednesday, October 2, 1996.
- 600.363: 9.1-2, 9.1-4, 9.3-2, 9.3-4, 10.3-1
- 600.463: 9.3-2, 9.3-4, 10.3-1, 10.1-2, 10.3-8
- HW 4: Due Wednesday, October 9, 1996.
- 600.363: 10.3-7, 22.3-1, 22.3-3, 22.4-3, 22-1
- 600.463: 10.3-7, 22.3-3, 22.4-3, 22-1, 22-3
- HW 5: Due Wednesday, October 16, 1996.
- 600.363: 13.1-2, 13.1-5, 14.1-4, 14.2-4, 14.2-5
- 600.463: 13.1-5, 13-2, 14.1-4, 14.2-5, 14-1
- Paper Review, Due Wednesday,
November 6, 1996.
- 600.363: Paper to review: W. Pugh, "Skip Lists: A
Probabilistic Alternative to Balanced Trees,"
Communications of the ACM, vol. 35, 1990, 668-676.
- 600.463: Paper to review: D. Sleator and R.E. Tarjan,,
"Self-Adjusting Binary Search Trees,"
Journal of the ACM, vol. 32, no. 3, 1985, 652-686.
- HW 6: Due Wednesday, November 13, 1996.
- 600.363: 16-1, 23.1-3, 23.2-6, 23.4-3, 23-3
- 600.463: 16-1, 23.1-3, 23.2-6, 23.2-7, 23-3
- HW 7: Due Wednesday, November 20, 1996.
- 600.363: 24.1-1, 24.1-5, 24.2-2, 24,2-4, 24.2-6
- 600.463: 24.1-5, 24.2-2, 24,2-4, 24.2-6, 24.2-8
- HW 8: Due Wednesday, November 27, 1996.
- 600.363: 25.2-2, 25.2-4, 25.2-5, 25.3-3, 25-3
- 600.463: 25.2-4, 25.2-5, 25.3-3, 25.3-5, 25-3
- HW 9: Due Wednesday, December 4, 1996.
- 600.363: 27.2-2, 27.2-8, 27-4, 34.4-3, 34.4-5
- 600.463: 27.2-8, 27.2-9, 27-4, 34.4-3, 34.4-5
Goodrich's Home Page.