Fall Term 2019 COSC 540 Algorithms
Instructor : Professor Bala Kalyanasundaram TA :
Office : St. Marys, Rm 329 Office :
Office hrs : Mon & wed Hours :
3:30 - 5:00 p.m. (or whenever I am free)
Phone : 687-2709 Phone :
TEXT : Materials from the Following:
Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein
Algorithms by Dasgupta, Papadimitriou and Vazirani
Algorithm Design by Kleinberg and Tardos
Approximation Algorithms by Vazirani
GRADING : EXAMS One or Two Midterms and a Final
(approx. 60%) NO MAKE-UPs
Many programming/written assignments.
ASSIGNMENTS Will be determined later.
(approx. 40% depends on number of midterms)
* Assignments are due before the class BEGINS on the day
they are due
* NO late submission.
EMPHASIS : To learn how to design and analyze algorithms.
Builds on basic desing and analysis techniques taught in
undergraduate Algorithms class. Introduce approximation,
parallel, online, randomization and quantum algorithms.
Understand P and NP.
SYLLABUS : (tentative)
September - Revisit algorithmic techniques; FFT, HMM, Optimization
Problems. Algorithmic problems in Geometry, Number Theory,
Strings etc.
October - Approximation Algorithms.
November - Parallel, Online, Randomized and Quantum Algorithms.
December - P, NP and beyond.
IMPORTANT :
Students are responsible for all instructions, exam announcements
and assignments given during REGULAR CLASS hours. For assignments, you are allowed to
collaborate, and read materials from any source. However, you MUST understand the solution
and MUST write the solution in your own words. No sharing of your writeup for the assignments.
Please see GU policy on cheating in the course work.