Algorithm Design Techniques From beginner to advanced (DAA)

Divide and Conquer | Dynamic Programming | Greedy | Back Tracking | Branch & bound | Algorithm Design and Analyse

Created by: Jithin Parakka
CTO and Cofounder @ Mapletechspace.com

What Will I 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

Requirements

• Knowledge of Data structures

Target audience

• Computer Science Students
• Programmers