Algorithm Design Techniques From beginner to advanced (DAA)
Divide and Conquer | Dynamic Programming | Greedy | Back Tracking | Branch & bound | Algorithm Design and Analyse
3.95 (22 reviews)
118
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
Why take this course?
//As you know behind every efficient software there will be an efficient algorithm.
But how do you build an efficient algorithm?
You can choose any of the design techniques such as Divide and Conquer, Dynamic Programming, Greedy Approach, Back Tracking & Branch and Bound.
From the technique listed above which one is suitable for your program/problem?
Take this course then you will be able to choose the right one.
/* This course is for both students and professionals */
Screenshots
Reviews
Cameron
December 7, 2020
Volume is very low, np section seems kinda rushed, greedy section is very short
otherwise solid course
Charts
Price
Rating
Enrollment distribution
Related Topics
2756802
udemy ID
1/13/2020
course created date
4/13/2020
course indexed date
Bot
course submited by