Topics in Contemporary Math   (MAT 1171)   <-   Courses   <-   Sean Forman   <-   You Are Here

Please feel free to contact me if you have any questions about what is posted here. View the front page for further contact information.

Fall 2001
Syllabus in HTML format

This area contains information regarding the course.

Thursday, October 18, 2001

Quiz for October 18, 2001

Today we finished up chapter 6 by discussing the Repetitive Nearest Neighbor Algorithm and the Cheapest Link algorithm. Both classes were lucky and were had their considerable knowledge quizzed today. We will begin Chapter 7 next time and will have an exam a week from Monday, October 29. In chap. 7 we will discuss trees and minimum spanning trees, but not Steiner Points.

For practice problems, you should do Chap. 6/1-11/odd, 17, 19, 23, 29, 37, 41

posted 6:07 PM

Traveling Salesman Problem Generator

A web application I wrote to create your own Traveling Salesman Problems.
posted 12:54 PM

Archive of Previous Days