Course Information
Course Overview
Fundamentals of Computer Algorithms.
The Highlights of the course are
1.How to write algorithms with clear explanation.
2.Analysis of Algorithms which can be measured with Time and space complexities.
3.Methods like Divide and Conquer , Greedy method, Dynamic Programming,Backtracking and Branch and Bound are clearly explained with Applications of each method with an example and algorithm.
4. The tracing of algorithms are clearly explained line by line.
Course Content
- 7 section(s)
- 37 lecture(s)
- Section 1 Introduction to Algorithms
- Section 2 Divide and Conquer method
- Section 3 Disjoint Sets and Representations
- Section 4 Greedy Method
- Section 5 Dynamic Programming and its applications.
- Section 6 Backtracking and its applications
- Section 7 Branch and Bound Applications.
What You’ll Learn
- Design and Analysis of Algorithms
Skills covered in this course
Reviews
-
SSai Pranav Pandiri
waste no proper explanation ,i dont even like the way he teaches no proper notes
-
pparv rangbulla
Not at all good, was unsatisfied with the whole course.
-
AARINJAY JAIN
v good and explaniable course
-
RRohan Gaikwad
Great Explained... All the concepts are covered.