Share Description
In this course, you will :
- Using these fundamental concepts, you will be able to understand and build efficient data structures and algorithms in a more intuitive manner.
- This will help you understand the concepts better and will make it easier for you to become a better programmer.
Syllabus :
1. Introduction
- What is an Algorithm?
- ADTs & Data Structures
- Efficiency of Algorithms
- How to analyze algorithms?
- Analysis of Algorithms (Practice)
2. Order of Growth
- Computing using runtime
- With multiple variables
- Order of an algorithm
3. Asymptotic Notations
- Ω (Big-Omega)
- O (Big-Oh)
- Θ (Theta)
- Time and Space Complexity Analysis
4. Recurrences
- Recurrence Relation
- Substitution Method
- Master Therorem
- Recurrence Tree Method
