|
|
|
|
|
Final Exam Study Guide
CSE 373: Data Structures & Algorithms - Autumn 2007
Wed, Dec 12, 10:30-12:20pm in KANE 110 (NOT our regular lecture room)
Exam policies
- Closed book, closed
notes. Calculators allowed (not sure they will be useful for anything but
you may use one if desired)
- The exam begins promptly at 10:30am and ends at 12:20pm.
Topics covered on the Final Exam:
The Final exam is cumulative, although a bit more weight
will be given to topics covered since the second midterm.
Midterm 1, Midterm 2
After Midterm 2:
- Sorting. Insertion sort, Selection sort, Heap sort, Merge sort, Quicksort.
- Bucket sort, Radix sort. Lower bound on comparison sorting. In-place sorting. Stable sorting.
- Graphs. Directed and undirected. Adjacency list and adjacency matrix representations.
- Topological sorting. Graph searching. Depth-first, breadth-first search.
- Shortest paths. Dijkstra's algorithm. Greedy Algorithms.
- Minimum spanning tree: the definition, Prim's and Kruskal's algorithms.
Study Suggestions:
All material from lecture up through minimum spanning trees is fair game.
|
