CISC 320 Algorithms and Advanced Programming

Syllabus, Fall, 2007

Course meeting time: MTF 8:00-8:50, place: 061 McKinley Hall

Saunders' office hours are 9-10am on Tuesdays and Thursdays in room 103A Smith Hall. Other meeting times can be arranged by contacting Vicki Cherry, cherry@cis.udel.edu, 831-2711.

Teaching Assistant: Scott Grauer-Gray
Office hours in room 102 Smith Hall: 11-12am Wednesdays and 9-10 Fridays.
Office: 212 Smith.
Email: grauerg@cis.udel.edu, Phone: 508-816-5687.

Text: Jon Kleinberg and Eva Tardos, Algorithm Design, Addison Wesley, 2006

References:
Cormen, Leiserson and Rivest, Introduction to Algorithms, McGraw-Hill & MIT Press, 1990.
Sedgewick, Algorithms in C++, Addison Wesley, 1992.
Goodrich and Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, Wiley, 2002.
Basse and Van Gelder, Computer Algorithms , Addison Wesley, 2000.

Objectives of the course

To develop a good working knowledge of important algorithms in several domains and the analyses of their performance characteristics. See topics list below.
To develop an appreciation for -- and a good understanding of -- general strategies of algorithm analysis and design.
To appreciate lower bound arguments, i.e., demonstrations of best possible performance properties for any algorithm to solve a given problem, regardless of whether an algorithm is known which achieves this best possible performance.
To learn the rudiments of complexity classes (a problem difficulty classification),in particular,, to appreciate the P = NP question and understand the significance of the "NP Complete" concept.

Topics

Algorithms of Selection, Sorting, and Searching in dynamic data sets. String matching. Arithmetic for large integers, polynomials, and matrices. Application of arithmetic to cryptography. Graph algorithms. Computational Geometry. NP Completeness. Parallel Algorithms.

Homework

Assignments will be distributed throughout the semester, for the most part on a bi-weekly basis. Homework is due by 4:30 on the date given. Homework received after this but before 4:30 on the next class day has a 20% penalty. Homework received after that but before 4:30 on the following day receives a 40% penalty. After this point we return graded homeworks and no longer accept late homework. Timeliness on assignments is important for your understanding of the material. This is not a subject that is effectively learned with periods of neglect and periods of cramming.

The course homepage will contain a frequently updated record of homework and reading assignments and synopsis of lecture topics.

Exams

There will be a midterm exam tentatively scheduled for Friday, October 12 and a final exam. The midterm exam will cover approximately a half of the course material. The final exam will be 1/4 on the first half and 3/4 devoted to the second half. The exams are closed book and closed note.

"Examinations are formidable even to the best prepared, for the greatest fool may ask more than the wisest man can answer." (Charles Caleb Colton)

Grading

Homeworks - 35% more or less
Midterm - 20% each
Final - 40% each
Class attendance and participation - 5%

Policy on plagiarism

Exams, pencil and paper exercises, and programming assignments are intended to measure your individual performance and accomplishments in the course. The writeup and organization of the solutions you submit must be entirely your own. You may consult books, papers, and web sources for ideas, however this is not necessary or recommended. Solutions you discover for your self, you own. They are much more memorable for exam time and for later life. Plagerism from other students in the course or anyone else is not tolerated.

http://www.cis.udel.edu/~saunders/courses/320/07f/
syllabus top

Corrections, suggestions and comments to saunders@cis.udel.edu