| Topic | Notes | Book Reading | Examples | Assignments | Solutions |
|---|---|---|---|---|---|
| Recursion/Divide+Conquer | Recursion | 4.1-4.4, 5.4 |
recursive.java towers.java Permute.java MyModPow.java LCSR.java QuickSelectApp.java QuickSelect.java StudentNode.java students.in |
Minesweeper Jumble dictionary.in |
MineSweeper.java mine.java Jumble.java |
| Graphs | Graphs | 1.4, 5.2 |
DFS_BFS.java DFS_BFS_class.java classgraph.txt |
Family Facespace |
family.java friends.java |
| Greedy Algorithms |
Greedy Algorithms Minimum Spanning Tree |
9.1-9.3 |
containers.java |
Room Scheduling Trains |
Schedule.java trains.java |
| Dynamic Programming |
Fib,Combo,Subset Sum LCS, Change, Knapsack |
8.1, 8.2, 8.4 |
fib.java subset.java floyd.java LCS.java change.java |
Stones World Series |
stones.java stones.in stones.out StonesViaLCS.java Series.java |
| Backtracking | Backtracking |
12.1 |
EightQueens.java MagicSquare.java |
Sudoku Connect4 RunConnectFour.java ConnectFour.java C4Contestant.java Bob.java Carol.java |