CS 3158 - Intro to Design of Algorithms
This course is an undergraduate course in algorithm analysis. The
course meets in two sections: section A, from 3:05 to 4:25 TUESDAY
and THURSDAY, and
section B, from 4:35 to 5:55 on TUESDAY and THURSDAY.
Both sections meet in Physics, lecture hall L5.
In addition, there is an optional review session every FRIDAY at
IC 217 from 12-1pm, which covers material from each previous week. This
review session is open to students from both sections.
This class is taught by
Dr. Milena Mihail.
Teaching assistants
are Keshav Attrey and
Michael Charles Smith. Office
hours are as follows:
- Dr. Milena Mihail: WEDNESDAY 1-2pm at her office (238 CoC)
- Michael C. Smith: FRIDAY 1-2pm either in the CoC commons or just outside CoC
- Keshav Attrey: MONDAY 6-7pm and TUESDAY and THURSDAY 11-12pm in the
CoC commons.
The required textbook for this course is Introduction to Algorithms by Cormen,
Leiserson and Rivest, McGraw Hill Press. Copies are available at the
bookstore.
There are, sadly, no used copies of this book, and I have not found a cheaper
copy available from an online bookstore.
There are two recommended textbooks for this course: The Design and
Analysis of Computer Algorithms by Aho, Hopcroft and Ullman; and
Data Structures and Network Algorithms by Robert Tarjan. Tarjan's
book is a collection of conference papers and is rather difficult to
obtain -- it takes 4-6 weeks to get it from Amazon.com. You may also want
to keep your 1155 text handy. For implementations of some of the algorithms
discussed in class, you might want to read Algorithms in C++ by
Robert Sedgewick (1992). You may also wish to look over The Art of
Computer Programming, a three-volume set on algorithms by Donald
Knuth.
Email Dr. Mihail: mihail@cc.gatech.edu
Email Keshav Attrey: keshav@cc.gatech.edu
Email Michael Charles Smith: msmith5@cc.gatech.edu
Last Modified: May 2, 1999