MTH 325: Guided Practice 13
Your last (or family) name: *
Your answer
Your email (for a confirmation receipt): *
Your answer
Exercises for this Guided Practice
Please work out your answers to these exercises separately (on paper or in a text file) and then put your answers for each one below. You will receive a PASS grade on this assignment if each of the following exercises is completed with a good-faith effort to be right, and if this form is submitted before the 11:59pm deadline on the day it's due (check the calendar for specific dates). Correctness is NOT part of the grade, although some questions will show you correct answers once you submit the form.
(REVIEW) Suppose that a graph G has an Euler circuit. Which of the following can we conclude about it? Select all that apply.
(SYLLABUS) What are the Learning Targets covered on Quiz 3?
Your answer
The "problem set" at the end of the video in the Guided Practice asks you to think about whether/why the complete bipartite graph K_{m,n} is Hamiltonian. Here is a picture of K_{3,4}. Is it Hamiltonian? If it is, give a Hamilton path as a sequence of vertices. Otherwise explain what happened as you tried to find a Hamilton path.
Captionless Image
Your answer
Now consider K_{4,4} below. Is this one Hamiltonian? Again if you believe it is Hamiltonian, then find a Hamilton path in it and state it as a sequence of vertices. Otherwise explain what happened as you tried to find a Hamilton path.
Captionless Image
Your answer
What possible uses could Hamilton paths have in computer science or in practical applications?
Your answer
What specific questions do you have about this lesson so far? (For questions about the course, grading, etc. please email those and do not include them here.)
Your answer
Submit
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Additional Terms