Questions

1. Why is shortest path problem useful?
2. Assumptions in shortest path algo?
3. What if its not a directed graph?
4. What is a negative cost cycle?
5. Problems with shortest path algorithm.
6. Properties of shortest path.
7. Finding pred(j)
8. Finding shortest path.
9. Everything you know about dijkstra’s algo? Slide and notes.
10. Actual algorithm of dijkstra?
    1. what is lambda plus of i and lambda minus of i?
    2. Time complexity? (O(V^2))
11. Solve an example of shortest path using dijkstras algo
    1. What is the predecessor vector?
12. Everything about bellman algorithm?
    1. Time complexity? (O|VE|)
13. What is a spanning tree and a minimum spanning tree?
14. Problem with minimum tree?
15. Network reliability problem?
16. Propertieds of MST?
    1. No of archis in Tree
    2. no of archs outside tree?
17. Kruskarls algorithm?
18. Prims algorithm? (Few slides pending check again)