APS Search and Dynamic Programming – ETE388/summer24

Assignments

• Search I (Complete Search) (Remaining: 129 days 6:32:23)
1. Candy Division
2. Euclid's Game
3. Selling Spatulas
• Search II (BFS/DFS) (Remaining: 129 days 6:32:23)
1. GREAT + SWERC = PORTO
2. Chicken Joggers
3. Promotions
• Search III (Binary Search) (Remaining: 129 days 6:31:23)
1. Hamiltonian Hypercube
2. Eko
3. Medals
• Search IV (Search harder) (Remaining: 129 days 6:32:23)
1. Colorland
2. Gokigen Naname
3. Square Fields (Hard)
• Dynamic Programming I (Remaining: 129 days 5:32:24)
1. Knapsack
2. Longest Increasing Subsequence
3. Errands
• Dynamic Programming II (Remaining: 129 days 6:32:24)
1. e-Coins
2. Hiding Chickens
3. Tug of War
• Dynamic Programming III (Remaining: 129 days 6:32:24)
1. ls
2. Roller Coaster Fun
3. Maximum Loot
• Dynamic Programming IV (Remaining: 129 days 6:32:24)
1. Exchange Rates
2. Buying Coke
3. Funny Games

Teachers