Spring 2003
This course has two parts.
The first part is an introduction to the Theory of Algorithms and covers the basic paradigms of the design of efficient algorithms.
The second part is an introduction to the Theory of Computation and covers basic computational machine models and their computational power.
Mon, Wed 4:05- 5:55, Skiles 268
Milena Mihail, Associate Professor
Office phone: 404-385-0617
Office hours: Tue 2:00-3:00 238 CCB, or by appointment
mihail@cc.gatech.edu
All TA office hours will be held in the CCB 1st floor commons area.
Stevie Strickland (sstrickl@cc.gatech.edu)
Office Hour: Monday and Wednesday 2:00-3:00Jianjun Zhang (zhangjj@cc.gatech.edu)
Office Hour : Thursday 2:00 - 3:30
Introduction to Algorithms, 2nd Edition, by Thosmas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Introduction to the Theory of Computation, by Michael Sipser
Weekly or biweekly homeworks: 20%, no collaboration. (Late policy: minus 20% for each day.)
Two quizzes: 25% each. First quiz is February 12. (Results will be handed on Feb 13th, last day to drop is Feb. 14th.)
Final: 30%.
A course in constructing proofs, a course in introduction to programming and a course in discrete mathematics.
For example, CS1050, CS1302, and MATH3012 (MATH3012 may be taken concurrently). If you do not have this background you should get permission of the instructor.
Course newsgroup git.cc.class.cs3500c
This site is maintained by Jianjun Zhang, please report problem to zhangjj@cc.gatech.edu.