Back to my homepage
Syllabus (Approx):
Graph Algorithms: Basic search algorithms, algorithms for shortest path problems, maximum flow.
String Algorithms: Pattern matching: KMP algorithm, suffix trees etc.
References:
- Introduction to Algorithms by Cormen, Leiserson, Rivest, Stein
- Online lecture notes by Jeff Erickson
- Algorithm Deisgn by Kleinberg and Tardos
Division of credit:
Attendance: 10% (Attend 50% of classes to get 10% and less than 50% of classes to get none.)
Theory Assignments : 20%,
Programming Assignments: 20%,
Quizzes: 50%