1 / 12

A problem

A problem.

rehan
Télécharger la présentation

A problem

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. A problem Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge, meaning that the torch must travel back across the bridge. When two people cross the bridge together, they must move at the slower person's pace. If person A can cross the bridge in 1 minute, B in 2 minutes, C in 3 minutes, and D in 4 minutes, how fast do all four of the cross the river?

  2. A problem Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge, meaning that the torch must travel back across the bridge. When two people cross the bridge together, they must move at the slower person's pace. If person A can cross the bridge in 1 minute, B in 2 minutes, C in 3 minutes, and D in 4 minutes, how fast do all four of the cross the river? What if the times are A(1), B(2), C(4), D (5)

  3. Path through a circuit that touches every vertex once, not all edges must be used • Must know by name • Can be used to explain precedence • Typically used to find most efficient route/order • Edges are weighted (values assigned) Hamiltonian Circuits

  4. BP Udall 9 mi For Example 16 mi 9 mi 25 mi 10 mi Mulvane Wellington 24 mi

  5. Traveling Salesman Problem 20 A B 35 40 25 45 C D 30

  6. ABCDA, ABDCA, ACBDA, ACDBA, ADBCA, ADCBA • Similar: They touch each vertex once; Different: Some order just in different direction • ABCDA (125), ABDCA (120), ACBDA (145), ACDBA (120), ADBCA (145), ADCBA (125) • 120 mi or minutes • Guess • (4 city routes: 12144), 25 city routes: 6.24 x 1023 • Answer

  7. VE Graph Test tomorrow

  8. Be able to explain what a vertex and an edge is • Example of VE Graph • A group of classmates convene in a room. They quickly realize that they’ve all met before. Julie’s boyfriend Bill is Tyrese’s roommate. Tyrese works with Shawnna and is related to Levi’s roommate. Shawnnawent to high school with Chris, Levi’s brother. Levi’s other brother, Xanderdated Julie before Bill. • Draw a Vertex Edge Graph modeling this situation • How many people are in the room? Test Prep

  9. Test Prep

  10. Test Prep • List all the different paths, and compute the length of each path. • Find the critical path and the EFT. Earliest Finish Time • What are the critical tasks? • Are there any tasks that can have their task times increased by 3 units and yet not cause a change in the EFT for the whole project? If so, which tasks? If not, why not?

  11. Consider the school yearbook staff who has 16 days to complete the yearbook. They know what they have to do and how long it will take. (They can only use one camera, but everyone will cooperate). Do they make it?

  12. Test Prep

More Related