Instructor : James Wong
Office : TH 967
Office Hours : Mon & Fri 11am-11:30am; Wed 11am-12noon & 6pm-7pm
Office Phone : 338-2858
Email : jwong@sfsu.edu

Prerequisite: A grade of B or better on CSC 510

Class Materials: http://userwww.sfsu.edu/~jwong/810/810.htm

• Introduction to Algorithms (2nd edit.), Cormen, Leiserson, Rivest & Stein. McGraw Hill, 2001
• Approximation Algorithms for NP-Hard Problems, Hochbaum, PWS Publishing, 1997
• Computer and Intractability : A Guide to the Theory of NP-Completeness, Garey & Johnson, WH Freeman 1979
• Computer Algorithms, Horowitz, Sahni & Rajasekaran, Computer Science Press 1998
• Foundations of Algorithm Using C++ Pseudocode (2nd edit.), Neapolitan & Namipour, Jones and Bartlett, 1998
• Fundamentals of Algorithms, Brassard & Bratley, Prentice Hall, 1996
• Algorithms (3rd Edit.), Robert Sedgewick, Addison Wesley, 1998
• Research Papers.

• Home Works/Quizzes 45%
• Class Presentation 20%
• Final Test 35%

• Review : Data structures, performance analysis, string matching, searching, graph & sorting algorithms
• Design techniques I: divide and conquer, greedy method, dynamic programming
• Design techniques II: backtracking, branch-and-bound
• NP-Complete problems and approximation algorithms
• Parallel algorithms: PRAM, MESH, Routing Messages in a Network
• Scheduling algorithms and other advanced topics