The final exam (Test #2) is scheduled for Dec. 7, 2004, 4 - 6:30 pm, in class (ENG II, 105). The main topics are those covered after Test #1; specifically: Divide-and-conquer (after page 5 of the notes), Heaps, Disjoint sets, Selection, Greedy algorithms, and Dynamic programming. The same formula sheet used in Test #1 will be provided but otherwise the test will be closed to notes, books, and calculating devices. Two sample tests without answers are: spring 03 Test #2 and summer 04 Test #2, posted 11/30/2004
Test #1 is scheduled for Thursday, October 14, 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:
spring 03 test
and
summer 04 test posted 9/30/2004
A version of
test #1
along with
a preliminary answer key
posted 10/19/2004