(Latest Revision -- 03/24/2002)
CS 4440 Study Guide for Quiz #1:
Study the homework problems of homework sets 1-2.
Study:
- chapter 3 : asymptotic notation (big-O, big-Omega, big-Theta)
- section 4.7 : recurrences
- section 5.9 : disjoint set structures
- section 5.7 : heaps
- Chapter 6 : greedy algorithmns
Also know the problems and algorithms indicated by the following list:
- Kruskal's algorithm
- Prim's algorithm
- Dijkstra's algorithm
- The Knapsack Problem
Be able to show what the algorithms indicated above will do in a
"walk-through." For example, if I tell you an input for one of these
algorithms, you should be able to describe, one at a time, the series of
changes the algorithm makes to its data objects, until the algorithm stops,
with the solution to the problem indicated in the values of the data
objects.
if I show you the values of the data objects mid-way through the execution
of one of these algorithms, you should be able to show me what changes the
algorithm will make next to the data objects.