Lecture notes
contents
Overview of the course contents
Covered in Data Structures and Algorithms
- Data Structures
- Algorithms
- Complexity Analysis
Algorithmic Design
- More advanced algorithms
- Algorithm families and techniques
- Greedy
- Divide and Conquer
- Dynamic Programming
- Solving problems efficiently
- Problems we believe we cannot solve → NP Completeness
- What to do when a problem doesn’t have a solution
Key takeaways
- a