CISC 320 Algorithms and Advanced Programming

Syllabus, Spring, 2001

Course meeting time: Tu,Th 2:00-3:15, place: 123 Sharp Lab

Saunders' office hours : 11:00-12:00 Tue, Wed, Thu. and by arrangement.

Teaching Assistant: Wei Du
Office hours in 404 Wolf Hall: 1-3pm Mon
Office: 214-A Smith Hall, 831-3132, Email: wei@cis.udel.edu

Text: Baase and Van Gelder, Computer Algorithms, Third Edition, Addison Wesley. 2000.

References:
Cormen, Leiserson and Rivest, Introduction to Algorithms, McGraw-Hill & MIT Press, 1990.
Sedgewick, Algorithms in C++, Addison Wesley, 1992.

The computer (composers) project number is 2103

Topics

-- Tentative Coverage, order, and pace

Chapters 1-3, Math preliminaries: scattered treatment as needed.
Chapter 5, Selection: 1 week.
Chapter 4, Sorting: 2 weeks.
Chapter 6, Dynamic sets: 2 weeks.
Chapter 11, String matching: 1 week.
Chapter 12, Polynomial arithmetic and FFT: 1 week.
Chapters 9, Transitive closure: 0.5 week.
Chapter 12, Matrix multiplication: 0.5 week.
Chapter 7, Graph traversals: 0.5 week.
Chapter 10, Dynamic programming: 0.5 week.
Chapter 8, MST and SSSP: 1 week.
Chapter 14, Parallelism: 1 week.
Chapter 13, Hard problems, NP Completeness: 2 weeks

Homework

There will be four homework assignments. Some exercises will involve programming and online algorithm measurements. Others will be of the "pencil and paper" variety.

The programming is to be Java or possibly C++. Grading of programs you write takes into consideration:

clarity - documentation, modularity, code structure, naming, formatting, ...
correctness - completeness and accuracy of the solution
performance - time and memory requirements of your solution.

Exams

There will be three exams, tentatively scheduled for Tuesday, March 13, Thursday April 19, and Friday May 25 (our final exam slot). These exams will not be comprehensive, and will be 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 - 34% more or less
Exams - 22% each
Class participation - this is the more or less

Late assignments

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 four class meetings late.

Policies

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; 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 homeworks 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.

Objectives of the course:

1. To give the student a good working knowledge of important algorithms in several domains.

2. To give the student an appreciation for, and an understanding of, algorithm design and analysis.

Course webpage:

http://www.cis.udel.edu/~saunders/courses/320/01s/

University Catalog 320 Course Description, CIS Dept. 320 Course Description.
syllabus top

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