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

Back to
Course Page