Test #2 is scheduled for Thursday, August 4, in class, from 6 to 9 pm;
test topics consist of everything covered after the first test including:
Divide-and-Conquer (after page 5), Heaps, Disjoint Sets, Selection,
Greedy and Dynamic Programming Algorithms, Backtracking, and
Branch-and-Bound Techniques;
two sample tests are posted 7/31/2005 (but no answer keys):
summer 04 test
and
fall 04 test;
sample answers to fall 04 Test #2
posted 8/02/2005
Test #1 is scheduled for Tuesday, June 21, in class; test topics include
the Mathematical Preliminaries, Computational Complexity, and Searching
Algorithms (up to page 5 of the Divide-and-Conquer notes);
a formula sheet
containing useful summation formulas and the "master" theorem for resurrences
will be provided during the test;
two sample tests with answers are:
summer 04 test
and
fall 04 test
posted 6/09/2005;
an answer key to Test #1
posted 6/23/2005