- Sorting and Searching Algorithms
- Sorting Techniques: Bubble Sort, Merge Sort, Quick Sort
- Searching Techniques: Linear Search, Binary Search
- Analysis of Time Complexity for Sorting and Searching
- Practical Applications
- Dynamic Programming and Recursion
- Fundamentals of Recursion: Concept, base case, and recursive relations
- Introduction to Dynamic Programming: Overlapping subproblems and memoization
- Solving classic DP problems: Fibonacci series, 0/1 Knapsack
- Problem-solving exercises