1. Purpose

• Strengthen practical skill of students in resolving software problems
• Emphasize analysis - design - implementation and optimization of algorithm in actual software development process: from problem to solution

2. Information

• Course name:                       Application of Algorithms
• Participant:                          
• Time:                                    15 weeks x 6 teaching periods
• Practice:                               Automatic evaluation system (Themis, SPOJ, ...)
• Programming language:       C/C++/Java
• Note:                                    Do not use STL to solve assignments

3. Overview Content

• Basic topics: Exhaustive search and greedy algorithms, divide-and-conquer, dynamic programming, sorting, Basic Graph algorithms with BFS, DFS and applications.
• Advanced topics: Advanced Graph algorithms, Algorithms based on standard Dijkstra, Prim, Disjoint-Set, Binary Heap, Algorithms on String.

4. Detail Content

References

[CLRS] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. MIT 2009.

Robert Lafore. Data structures and Algorithms in Java (2nd Edition). Sams Publishing, 2002.

Note:

Due to the course is concentrate on practice, number of assignments in each session as following:

Đề xuất bài tập về nhà (trên hệ thống thực hành online SPOJ)