Share Description
In this course, you will learn:
- A thorough comprehension of algorithms and their use in problem solving
- Ability to implement recursion and backtracking in Python for difficult jobs.
- Understanding the notion of memoization and dynamic programming.
- Ability to use memoization and dynamic programming for efficient computation in Python
- Practical practice addressing algorithmic challenges in Python.
Syllabus :
- Introduction to Algorithm
- Recursion
- Backtracking
- Dynamic Programming
- Greedy Algorithms
- Prove Your Skills: A Five-Chapter Assessment
- Basic Graph Algorithms
- Depth-First Search
- Minimum Spanning Trees
- Shortest Paths
- All-Pairs Shortest Paths
- Pushing Your Limits: A Comprehensive Assessment
