CS580, Design and Analysis of Algorithms (Sec. 19710), 3 credits (Spring '08)

Class time: Mon. & Wed. 4:30p.m. - 5:45 p.m.

Class room: SL 051.

Instructor: Dr. Xukai Zou

(Office: SL 280F; Phone: 278-8576; Email: xkzou@cs.iupui.edu)

Office Hours: Mon., Wed. 1:30 p.m. - 2:30 p.m. or by appt.

TA: Omkar Tilak (otilak@cs.iupui.edu), Office Hours: Mon., Wed. 3:00 p.m. - 4:30 p.m. or by appt.

Syllabus

Homework Assignments
Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
Lectures
  1. Brief introduction to algorithm analysis and design using sorting algorithms Lecture slides
  2. Recurrences and master theorem (Chapter 4)Lecture Slides
  3. Divide and Conquer--closest pair (Chapter 33.4) Lecture slides
  4. Lower bound: decision tree & adversary argument Lecture Slides Sorting in linear time
  5. Selection: Order Statistics (prune & search technique) (Chapter 9). Lecture Slides
  6. Dynamic Programming (Chapter 15). Lecture Slides
  7. Greedy Algorithms (Chapter 16). Lecture Slides
  8. Amortized Analysis (Chapter 17) Lecture Slides
  9. Balanced Search Trees (red-back tree) Lecture Slides (Other search tree)
  10. Augementing data structureLecture Slides
  11. Disjoint Sets (Chapter 21). Lecture Slides
  12. NP-Completeness (Chapter 34) Lecture Slides
  13. String/Pattern Matching (Chapter 32). Lecture Slides
  14. Parallel Algorithms (Selected from Chapter 30, the First Edition). Lecture Slides
  15. Approximation Algorithms (Chapter 35). Lecture Slides
  16. Summary of lectures Summary Slides
  17. Linear Programming
  18. Some Problems using Prune-and-search technique
Useful links
Introduction to Algorithms, second edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, MIT Press, 2001, ISBN 0-262-03293-7.
errata list
Karp's_21_NP-complete_problems

Questions? Please send e-mail to me, xkzou@cs.iupui.edu or our TA Omkar Tilak at otilak@cs.iupui.edu.