Euler Circuits

41950L8 TOPOLOGY /GEOMETRY

Activity 1: Euler Circuits
With a group discuss Euler Circuits. What questions do you still have? What do you or don’t you understand?

Activity 2: Duck Hunt!
The graphs from last week were interesting, but their applications are a little more limited for every day-use. Let’s try something a little more interesting: a duck hunt!
See the job aid for directions.

Activity 3: How do Hamilton Circuits compare with Euler Circuits?
Now that you’ve spent time on Euler and Hamilton Circuits, which one do you feel like is more impactful to you? Can you find a specific example that uses graph theory in any of the capacities that we’ve explored in these last few weeks?
And once you find that application, can you pose a reasonable solution?

Project Assignment – Task 8: Which Course Learning Outcomes does the game best demonstrate?
Over the past 8 weeks you have been analyzing your chosen game from the first Module. Your task this week is to bring everything that you have learned back to the beginning of the class, specifically the course syllabus. On page 2 it lists all of the Course Learning Outcomes (i.e. the stuff that you’re supposed to be learning!).
When you consider your game (a duck hunt) and everything that you have considered over this term, which learning outcomes does your game best exemplify? Which outcomes does your game completely avoid? Are there any that the game could hit if you “stretched it”?
Be specific in your analysis because this is the best evidence you can provide this term to show that you learned something!

****** FYI: ====== Student Learning Outcomes
Upon completion of this course, the student will be able to:
1. Perform mathematical operations on integers and rational numbers, as well as factoring on polynomials, and radicals.
2. Interpret and solve linear and nonlinear equations and inequalities.
3. Apply logic and problem solving to explore mathematical sets and models.
4. Solve real-world problems using graph theory principles.
5. Select appropriate algorithms from various types to reach an appropriate solution to a problem.

**** see attachment.