DAA CS205, Odd Sem 2025-26, DTU
A3 Batch, 2nd Year
Mon 11-12 PM, Tue 3-4 PM, Thu 11-12 PM in AB4 016 and Fri 1-2 PM in AB4 201
Instructor: Garima Chhikara
Email: garimachhikara@dtu.ac.in
Links:
| Class No. | Date | Topic | Class Notes |
| 1 | 5 Aug 2025 | Recursion | Aug 5 |
| 2 | 7 Aug 2025 | Recursion | Aug 7 |
| 3 | 8 Aug 2025 | Recursion | Aug 8 |
| 4 | 11 Aug 2025 | Time Complexity | Aug 11 |
| 5 | 14 Aug 2025 | Recursive TC, Binary Search | Aug 14 |
| 6 | 18 Aug 2025 | Binary Search | Aug 18 |
| 7 | 19 Aug 2025 | Merge Sort, PYQ | Aug 19 |
| 8 | 21 Aug 2025 | Quick Sort, Heap | Aug 21 |
| 9 | 22 Aug 2025 | Heap | Aug 22 |
| 25 Aug 2025 | Class Test Recursion | Test , Solution | |
| 10 | 26 Aug 2025 | Heap | Aug 26 |
| 11 | 29 Aug 2025 | Backtracking | Aug 29 |
| 12 | 1 Sep 2025 | Backtracking | Sep 1 |
| 13 | 2 Sep 2025 | Backtracking | Sep 2 |
| 8 Sep 2025 | Class Test Backtracking | Test , Solution |
| Topic | Class Questions |
| Recursion | Print Subsequences of String |
| Permutations of String | |
| Climbing Stairs Ways Print | |
| Lexicographical Counting | |
| Palindrome Partitioning | |
| Different Ways to Add Parentheses | |
| Tower of Hanoi | |
| Time Complexity | Sieve of Eratosthenes |
| Fast Exponentiation to Calculate Power | |
| Binary Search | Aggressive Cows |
| Book Allocation | |
| Capacity To Ship Packages Within D Days | |
| Backtracking | Blocked Maze |
| Sudoku Solver | |
| N Queen | |
| K Knights | |
| Knight Tour |
| Topic | More Practice Questions | Comment / Hint |
| Recursion | Generate Parentheses | Two options - open and close |
| Subsequences with Ascii | At every stage 3 options | |
| Keypad Combination | At every stage variable 3 options | |
| Combination Sum | Coin Change with infinite supply | |
| Combination Sum II | Coin Change with each coin used only once | |
| Combinations | Subset of given size | |
| Combination Sum III | Subset of given size and sum | |
| Subsets | Subset = Subsequences in array | |
| Subsets II | Subset with duplicates | |
| Permutations | Array permutation with no duplicates | |
| Permutations II | Array permutation with duplicates | |
| Permutation Sequence | Kth permutation | |
| Letter Tile Possibilities | Permutations with duplicates | |
| Maximum Length of a Concatenated String | Subsequence of maximum length | |
| Sequential Digits | Similar to lexicographical counting | |
| Split Array into Fibonacci Sequence | Similar to palindrome partitioning | |
| Restore IP Addresses | Similar to palindrome partitioning | |
| Additive Number | Similar to palindrome partitioning | |
| Binary Watch | Two options - include or exclude | |
| Binary Search | Painter Partition | |
| Koko Eating Bananas | ||
| Heap | K Largest Element | |
| Merge K Sorted Arrays |