Presentation is loading. Please wait.

Presentation is loading. Please wait.

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.

Similar presentations


Presentation on theme: "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."— 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 Hamiltonian Circuits 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)

4 For Example BPUdall MulvaneWellington 9 mi 24 mi 10 mi 9 mi 16 mi 25 mi

5 Traveling Salesman Problem AB CD

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

7 tomorrow VE Graph Test

8 Test Prep 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. Shawnna went to high school with Chris, Levi’s brother. Levi’s other brother, Xander dated Julie before Bill. Draw a Vertex Edge Graph modeling this situation How many people are in the room?

9 Test Prep

10 a)List all the different paths, and compute the length of each path. b)Find the critical path and the EFT. Earliest Finish Time c)What are the critical tasks? d)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? TaskTimePrerequisite Start0- A Buy film 1None B Load Cameras 1A C Take Photos of Clubs 3B D Take Sports Photos 2C E Take Teacher Photos 1B F Develop Film 2 D, E G Design Layout 5 D, E H Print & Mail Pages 3 G, F

12 Test Prep


Download ppt "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."

Similar presentations


Ads by Google