University of Nevada Las Vegas
Howard R. Hughes College of Engineering
School of Computer Science
My Home Page

UNLV CS 477/677 Spring 2011 Second Examination

Date: Thursday, March 29, 2012, 2:30 PM.

  1. Solving recurrences. (Because the performance last time was not adequate.)
  2. Huffman's Algorithm.
  3. Kruskal's Algorithm.
  4. Union-Find.
  5. Shortest Path Algorithms.
    1. Simple dynamic programming.
    2. Bellman Ford Algorithm.
    3. Floyd Warshall Algorithm.
    4. Dijkstra's Algorithm.
    5. A* Algorithm.
  6. Order Statistics in O(n) time. (Finding the kth smallest element of an unordered list.)
  7. Dynamic Programming.
  8. Hashing
    1. Closed or Open?
    2. Linear Probing.
    3. Other Probing.
    4. Cuckoo Hashing.
    5. Perfect Hashing.
    6. Secondary Hashing.
  9. Standard storage of arrays of dimensions 1, 2, or 3, in row-major or column-major order.
  10. A few difficult questions, covering some of the hardest topics we went over.

Back to Course Page