ALGORITHM DESIGN AND ANALYSIS (4 Credits)

Learning Outcomes:

On successful completion of this course, student will be able to: Explain fundamental concept of analysis algorithms; Apply algorithm techniques and methods; Solve a problem using specific algorithm; Compare several algorithm design methods.

Topics:

Introduction of design and analysis of algorithms; Mathematical induction and recursive function; Algorithms and complexity functions; Complexity of algorithms analysis; Stack and queue; Tree and binary tree; Priority queue and heap; Graph; Divide and conquer; Greedy methods; Dynamic Programming: Fibonacci Sequence Problem; Dynamic Programming: Coin Change Problem; Dynamic Programming: Multistage Graph; Dynamic Programming: Travelling Salesman; Dynamic Programming: Knapsack Problem; String Matching; Huffman Code; Graph Colouring; Basic Search and Traversal; Backtracking; Branch and Bound; Strongly Connected Components; Review