Algorithm Design and Analysis
Learning Outcomes
On successful completion of this course, student will be able to: 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
- 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 Problem
- Dynamic Programming: Knapsack Problem
- Code Optimization
- Huffman Code
- Graph Colouring
- Basic Search and Traversal
- Backtracking
- Branch and Bound
- Designing algorithm with specified complexity
- Practices of algorithm analysis
Published at :
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...