Prelim1reviewsheet

Prelim1reviewsheet - 5 Verifying the SPT is correct using...

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

View Full Document Right Arrow Icon
ENGRI 1101: Prelim 1 Review Sheet March 2, 2011 The Prelim is on Tuesday, March 15 from 7:30-9:00 PM in Phillips 219. Class is open for questions on March 15. Special office hours: I will hold office hours from 10-12 on Monday the 14th, from 3-6:30 also on Monday, and from 11:15-2 on Tuesday March 15 (all in Rhodes 412). You may bring one 3 × 5 note card to the exam which you will turn in with your exam. The Prelim will cover the first 5 weeks of the course through Baseball Elimination (the end of HW 5) including the corresponding readings. Traveling Salesman Problem 1. Problem definition: requirements for a feasible solution, objective. 2. Nearest neighbor algorithm. 3. Input is symmetric? triangle inequality holds? 4. Lowerbound on the optimal tour (see hw 1 solutions). Shortest Path Problem 1. Problem definition: directed graph, special node s , shortest path from s to every other node in the graph. 2. Triangle inequality holds? 3. Dijkstra’s Algorithm (running the algorithm with tables). 4. Finding the shortest path tree from the final Dijkstra Table.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5. Verifying the SPT is correct using the final node labels (see reading, hw solutions). 6. Sensitivity of the SPT to changes in edge lengths. • Minimum Spanning Tree Problem 1 1. Problem definition: undirected graph, requirements for a feasible solution, objective. 2. Properties of trees, cycles, etc. 3. Prim’s Algorithm (running it). 4. Kruskal’s Algorithm (running it). 5. Sensitivity of the MST to changes in edge lengths. • Max Flow Problem 1. Problem definition: requirements for a feasible solution, objective. 2. The Ford Fulkerson Algorithm (running it). 3. Details and ideas about the residual graph. 4. Using the final residual graph to find the min cut. 5. Every flow is less than every cut ⇒ Max flow ≤ Min cut. 6. Sensitivity of the Max flow to edge capacities changing. 7. Baseball elimination. 8. Writing problems (like assigning students to advisors) as maxflow problems. 2...
View Full Document

This note was uploaded on 09/07/2011 for the course OR 1101 taught by Professor Trotter during the Fall '09 term at Cornell.

Page1 / 2

Prelim1reviewsheet - 5 Verifying the SPT is correct using...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online