CS 381: Introduction to Analysis of Algorithms
FALL 1999
The course gives a broad introduction the design and analysis of
computer algorithms. General topics to be covered include:
growth of functions, recurrences, sorting and order statistics,
fundamental and advanced data structures, dynamic programming,
greedy algorithms,
graph searching and graph algorithms, string matching,
NP-completeness, approximation algorithms,
parallel and distributed algorithms.
Instructor, Section 1
Professor Susanne E. Hambrusch
seh@cs.purdue.edu,
216 CS Building
Class Time: MWF 9:30, LAEB 2280
Office Hours: Wednesday, 2-3pm, Friday, 11-12pm.
Instructor, Section 2
Professor Concettina Guerra
guerra@cs.purdue.edu,
226 CS Building
Class Time: MWF 12:30, BRWN 1151
Office Hours: Monday, Wednesday, 11-12pm.
Teaching Assistants
-
Biana Babinsky,
babinsb@cs.purdue.edu ,
403 Math. Sciences Bldg., 4-5005.
Office hours: Tuesday, Thursday 9-10am.
-
Tian Luan,
luan@cs.purdue.edu ,
403 Math. Sciences Bldg., 4-5005.
Office hours: Tuesday, Friday 3-4pm.
-
Cenyu Zhang,
czhang@cs.purdue.edu ,
435 Math. Sciences Bldg. 4-6019
Office hours: Wednesday 4-5pm, Thursday 11-12pm.
Text (required)
-
Computer Algorithms,
Third Edition, ISBN 0-201-61244-5,
Sara Baase and Allen van Gelder,
Addison-Wesley, 2000.
The book was scheduled to be out by August 1999, but production problems
have delayed publication. The publisher has sent the first 9 chapters
(tape bound version) to the bookstores (University Bookstore,
Boiler Bookstore,
Village Bookstore, Purdue Bookstore). Students
will be able to buy this pre-published version
at a reduced cost and then exchange it
for the book at no extra cost.
Do not buy the second edition of this text!
Supplementary texts focusing on data structures
-
Data Structures and Algorithms, A. Aho, J. Hopcroft, J. Ullman,
Addison-Wesley, 1983.
-
Data Structures and Algorithms in Java,
Michael T. Goodrich and Roberto Tamassia, John Wiley and Sons, Inc.,
1998.
-
Algorithms 2nd edition/Algorithms in C/Algorithms in C++,
R. Sedgewick,
Addison Wesley, 1988/1990/1992.
Supplementary texts on algorithms
-
Introduction to Algorithms, A Creative Approach, Udi Manber,
Addison-Wesley, 1989.
-
The Design and Analysis of Computer Algorithms,
A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Addison-Wesley, 1974.
-
Introduction to Algorithms
T. Cormen, C. Leiserson, R. Rivest, McGraw-Hill, 1990.
Course work
-
9-10 homework sets: 30%
-
Midterm exam: 35% (evening exam, date to be announced)
-
Final exam: 35%
Course policies
-
No late homework sets will be accepted.
-
For a regrade on a homework contact the TA responsible for the
question
within 10 days from the date when the assignment was officially returned.
No regrading after this period.
A regrade means that the enire homework or project undergoes a regrade.
-
Cheating directly affects the reputation of the Department
and the University and lowers the morale
of other students. Cheating will not be tolerated.
Cases of cheating will be sent directly to the Dean of
Students Office. An automatic grade of F will be assigned
to any student caught cheating.
Presenting another person's work as your own constitutes cheating.
Everything you turn in must be your own doing.
The following activities are specifically forbidden
on all graded course work:
-
Theft or possession of another student's solution
or partial solution in any form
(electronic, handwritten, or printed).
-
Giving a solution or partial solution to another student,
even with the explicit
understanding that it will not be copied.
-
Working together to develop a single solution and
then turning in copies of that solution
(or modifications) under multiple names.
Susanne E Hambrusch
Last modified: Fri Sep 3 15:10:39 EST 1999