1 / 3

Problem Set 1

Problem Set 1

harvey
Télécharger la présentation

Problem Set 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Problem Set 1 Two jugs A and B have capacities of 3 quarts and 5 quarts, respectively. Use the jugs to measure exactly one quart of water. Take into account the following considerations: You may fill either jug to capacity from a water tap; you may empty the contents of either jug into a drain; you may pour water from each jug into the other. 2. Use nearest-neighbor algorithm to find a Hamiltonian circuit in the following graph.

  2. Use nearest-neighbor method to find a Hamiltonian circuit in the following graph. • Start at vertex A. • Start at vertex D. • Determine a minimum Hamiltonian circuit for the graph. 4. Use mathematical induction to show that any postage of at least 12-cents can be obtained using 3-cents and 7-cents stamps.

  3. 5. Find Euler’s path/circuit in the following graphs.

More Related