Lectures: Tuesday and Thursday
Web page: http://www.cis.udel.edu/~lliao/cis320f05
|
Staff |
Name |
Office |
Email |
Phone |
Office Hours |
|
Instructor |
Li Liao |
Rm 204, |
lliao@cis.udel.edu |
831-3500 |
10:00AM - 11:30AM Tuesdays and Thursdays, or by appointment |
|
TA |
Mani Thomas |
115 B Pearson Hall |
mani@UDel.Edu |
|
|
Design and analysis of algorithms: worst/average case analysis, proofs for correctness and performance of algorithms. Algorithmic strategies (divide and conquer, greedy methods, dynamic programming, etc.). Algorithms for searching, forming and traversal of strings, trees and graphs. Categorization of computational problems: classes P and NP. NP completeness.
1. Working knowledge of important algorithms in several domains.
2. In-depth understanding of algorithms design and analysis.
MATH210 and a minimum grade of C- in CISC220
Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, Second Edition, McGraw-Hill & MIT Press, 2002.
There will be five homework assignments (8% each), and two exams (30% each).
Some assignments will involve programming, and the others will be of the
"pencil and paper" variety.
The programming is to be in either Java or C++. Grading of the programming
exercises is primarily based on:
One exam is tentatively scheduled for Tuesday, October 18, and the other exam is in the final exam period. Each exam will cover approximately one half of the course material, and will be closed book and closed notes.
Assignments are due at the beginning of class on the assigned date. Pencil and paper exercises will NOT be accepted late, since sketches of solutions will be handed out at the end of the class in which the homework is due. Unexcused late programs will be penalized 5% per class meeting, and will not be accepted more than three class meetings late.
Exams, pencil-and-paper exercises, and programming assignments are intended to measure your individual performance and accomplishments in the course. Thus, the following are considered cheating and will be dealt with accordingly: looking the solution up in any source other than those listed above; looking up the solution by locating a paper in the literature; looking in any way at solutions from other courses at Delaware or elsewhere; posting the problem on the Internet, seeking a solution; getting a solution from (or giving a solution to) another person; etc. You may ask others for clarifications of the problem statement. If in doubt, ask the instructor. Final grades will be formulated by totaling the grades from exams, and homework for each student (weighted as noted above), and then assigning appropriate boundaries between letter grades (including +/-). For those close to the boundaries, class attendance and participation can be a positive (or negative) factor.