Algorithm Design and Analysis (4 Credits)

Learning Outcomes:

Explain fundamental concept of analysis algorithms; Apply algorithm techniques and methods; Calculate processing time and memory space of algorithms; Compare several algorithm design methods

Topics:

1. Introduction of design and analysis of algorithms, Mathematical induction and recursive function and Algorithms and complexity functions
2. Complexity of algorithms analysis, Stack and queue and Tree and binary tree
3. Priority queue and heap, Graph and Divide and conquer
4. Greedy methods
5. Dynamic Programming: Fibonacci Sequence Problem and Dynamic Programming: Coin Change Problem
6. Dynamic Programming: Multistage Graph and Dynamic Programming: Travelling Salesman Problem
7. Dynamic Programming: Knapsack Problem and Code Optimization
8. Huffman Code and Graph Colouring
9. Basic Search and Traversal, Backtracking
10. Branch and Bound, Designing algorithm with specified complexity, Practices of algorithm analysis