History

 

Objective::

Students will discover the impetus behind the algorithms for both Euler and Hamiltonian circuits and paths. Students will be able to discuss the application, advantages and disadvantages of each of the algorithms from the unit.

Materials :

History Sources for:

• Euler
• Hamilton
• Kruskal
• Bridges of Konigsberg Problem
• Chinese Postman Problem
• Traveling Salesman Problem
• Hamilton's marketed games in 3D and 2D
• Graph Theory
• Minimization

Lesson:

The first day of this lesson can either be conducted in the media center, or in the classroom. If you wish to conduct the lesson in the classroom, you will need to have the Media specialist pull resources onto a cart for classroom use.

In either instance the students should work in small groups [2 - 3] and be assigned a specific investigation to report back on to the class as a whole. Groups should pay particular attention to any people or algorithms they discover that have not bee addressed in class and report back about them. Listen for students who want to use only one source and limit their report to the knowledge gained through the unit in class.

The second day of this lesson should center around reports. Be sure to fill in gaps and maintain focus as each group begins their presentation.

Assignments:

(Day 1) Prepare presentation for the class around your groups assigned investigation topic.

(Day 2) Reflective writing assignment. The assignment should include some mention of each of the investigations reported on to the class as a whole.