CS431102 Design and Analysis of Algorithms

1
CS431102Design and Analysis of Algorithms
2
Teaching Plan

• Part I Foundations
• Growth of Function, Solving Recurrence
• important in the analysis part
• Part II Sorting Order Statistics
• Part IV Advanced Design and Analysis Techniques
• Dynamic Programming
• Greedy Algorithms

3
Teaching Plan

• Part VI Graph Algorithms
• Minimum Spanning Tree
• Shortest Path, Maximum Flow
• Part VII Selected Topics
• String Matching
• NP-Completeness
• Approximation Algorithms (if we have time)

4
Textbook References

• Textbook
• Introduction to Algorithms (Third Edition), by
  Cormen et al.
• References
• Introduction to Design and Analysis of
  Algorithms, by Lee et al.
• Algorithms in C, by Sedgewick
• Foundations of Algorithms, by Neapolitan
  Naimipour

5
Assessment

• Class Attitude 5
• Assignments 20
• Middle Exam 1 25
• Middle Exam 2 25
• Final Exam 25

6
Websites

• Course
• http//hscc.cs.nthu.edu.tw/sheujp/index.html
• Solutions
• http//mitpress.mit.edu/algorithms/