UNLV CS 477/677 Fall 2013 Second Examination

Date: Monday, October 14, 2013, 2:30 PM.

1. Sorting algorithms.
2. Perhaps a few recurrences.
3. Huffman's Algorithm.
4. Kruskal's Algorithm.
5. Union-Find.
6. Shortest Path Algorithms.
   1. Simple dynamic programming.
   2. Bellman Ford Algorithm.
   3. Floyd Warshall Algorithm.
   4. Dijkstra's Algorithm.
   5. Johnson's Algorithm.
7. Dynamic Programming.
8. Stack Algorithms for Evaluation of expressions.
9. The examination of February 23, 2012
   There is only one question on this test that asks about material we have not covered, and that is question 7. We should have covered it, but we didn't get to it.
10. The examination of March 29, 2012
    Only some of the questions on this test concern material that we have covered so far this semester. These are:
    1. Problem 1(c).
    2. Problem 2(b).
    3. Problem 2(d).
    4. Problem 4.
    5. Problem 5.
    6. Problem 6.