Algorithm Design Techniques From beginner to advanced (DAA)
Divide and Conquer | Dynamic Programming | Greedy | Back Tracking | Branch & bound | Algorithm Design and Analyse
3.87 (27 reviews)
144
students
8.5 hours
content
May 2020
last update
$44.99
regular price
What you will learn
Analyze a given algorithm and express its time and space complexities in asymptotic notations.
Solve recurrence equations using Iteration Method, Recurrence Tree Method and Master’s Theorem.
Design algorithms using Divide and Conquer Strategy.
Compare Dynamic Programming and Divide and Conquer Strategies.
Solve Optimization problems using Greedy strategy.
Design efficient algorithms using Back Tracking and Branch Bound Techniques for solving problems.
Learn the fundamentals of complexity theory
Screenshots
Related Topics
2756802
udemy ID
1/13/2020
course created date
4/13/2020
course indexed date
Bot
course submited by