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:
- Mathematical induction and recursive function
- Algorithms and complexity functions
- Complexity of algorithms analysis
- 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
- Backtracking
- Branch and Bound
- Strongly Connected Components
- Review
- Introduction of design and analysis of algorithms
- Analysis of Data Structures: Stack, Queue, Tree, and Binary Tree
- Analysis of Data Structures: Graph (Basic Search & Traversal), Priority Queue, and Heap
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...