Final Exam
| Time and Place: | Tuesday, April 24, 10:00 am to 12:30 pm in CLI-308 (i.e., the classroom). |
| Topics: | All topics covered in the semester, which include all lecture notes in Powerpoint slides (which correspond to Text's Chapters 1 - 4, 6, 7, and parts of 9 and 10); review the old tests and homework, and programming in java or c++ (a linked list class maybe provided for programming questions) |
| Format: | Closed-book, closed-notes, no calculators; bring a photo-id to the test. |
Exam 2
| Time and Place: | Tuesday, April 3, 11:30 am to 12:45 pm in CLI-308 (i.e., the classroom). |
| Topics: | The course notes chapters on Heaps, Sorting & Divide-and-Conquer techniques, and Greedy Algorithms (up to slide page 15, i.e., before graph algorithms), which correspond to Textbook chapters 6, 7, and part of 10. |
| Format: | Closed-book, closed-notes, no calculators; bring a photo-id to the test. Sample test questions are posted 3/27/01 here; a partial solution key is posted 3/29/01, then updated 4/01/01 here; a solution key to Test 2 is posted 4/05/01 here. |
Exam 1
| Time and Place: | Thursday, Feb. 15, 11:30 am to 12:45 pm in CLI-308 (i.e., the classroom). |
| Topics: | Chapters 1-4 of the Text, the course notes online, and c++ or java proramming; the kinds of questions will be similar to those on the homework including language specific questions (e.g. operator overloading (for c++) overloaded methods (for java), class constructors, etc.) |
| Format: | Closed-book, closed-notes, no calculators; bring a photo-id to the test. |