# exam3 - What is its weight? ( OVER ) A F G H I B D E C A B...

This preview shows pages 1–2. Sign up to view the full content.

MA 103 QUIZ 3 1. Consider the following graph: a) Does the graph have an Euler circuit? If so, find one; if not, explain why b) Does the graph have an Euler path? If so, find one; if not, explain why. c) Find a Hamilton circuit. 2. Consider the following graph: a) How many Hamilton circuits does this graph have? b) Use the nearest neighbor algorithm to approximate a minimal weight Hamilton circuit starting at A. What is its weight? c) Use the nearest neighbor algorithm to approximate a minimal weight Hamilton circuit starting at B . What is its weight? d) Use the cheapest link algorithm to approximate a minimal weight Hamilton circuit starting at A.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: What is its weight? ( OVER ) A F G H I B D E C A B C D E 18 47 38 71 62 56 73 49 84 65 3. The following graph represents a map of the streets of a town. Describe whether each of the following problems involves an Euler circuit or a Hamilton circuit and then write down the circuit beginning and ending at H (Eulerizing if necessary). a) There is a storm sewer at each intersection; after a storm you have to inspect each sewer to make sure that it is not clogged. b) After a storm you must inspect each street to make sure that it is not blocked by fallen branches. You may label the vertices to aid your description. H...
View Full Document

## This note was uploaded on 03/27/2009 for the course MA 103 taught by Professor Solfiell during the Spring '08 term at N.C. State.

### Page1 / 2

exam3 - What is its weight? ( OVER ) A F G H I B D E C A B...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online