CSC 1700
DESIGN AND ANALYSIS OF ALGORITHMS

Spring, 1999

Instructor:

Dr. Anany Levitin
levitin@monet.vill.edu
Office: 162B Mendel Hall
Class hours: TR: 3:00-4:15, M154
Office hours: TR: 1:00- 3:00 and by appointment
Instructor Homepage: http://www.csc.vill.edu/~LEVITIN/

Prerequisites:

Text and References:

Grades:

weekly quizzes (average of 10 best) 30%
programming projects 20%
midterm 20%
final 30%
the average of the two exams must be >50 to pass the course

Homework:

A homework will be assigned after each lecture and will include textbook reading and exercises. Though the homeworks will not be collected for grading, doing them timely and diligently is crucial for mastering the subject.

Qizzes:

10-minute quizzes will be given every Tuesday;
No make-up quizzes will be given.

Syllabus:

Major algorithm design techniques; theoretical and empirical analysis of nonrecursive and recursive algorithms; applications to important algorithms for sorting, searching, string matching, graphs, and some mathematical problems; P and NP complexity classes, approximation algorithms.

Important NOTES:

1. PROJECTS AND EXAMS MUST BE SOLELY THE WORK OF THE STUDENT / STUDENT   TEAM SUBMITTING THEM.
2. NO LATE ASSIGNMENTS WILL BE ACCEPTED UNLESS AN EXTENSION HAS BEEN  GRANTED BY THE INSTRUCTOR PRIOR TO THE DEADLINE.
3. Late projects/missed quizzes and exams will be counted as 0 (unless a prior excuse has been granted).   No make-up quizzes will be given.
4. Projects should be done on the Villanova UNIX system (please, contact the instructor if you need an     account) or, with the instructor's special permission, on a PC.