Weekly Schedule (subject to change.)

Week	Monday	Tuesday	Wednesday	Thursday	Friday	Saturday	Sunday
0	9/23	9/24	9/25	9/26 Intro/Fibonacci 101F24_day1.pdf 101F24_day1_annotated.pdf	9/27	9/28	9/29
1	9/30	10/1 Graphsearch/ DFS/ Explore (3.1, 3.2, 3.3) 101F24_day2_graphsearch.pdf 101F24_day2_graphsearch_annotated.pdf	10/2 HW1 Practice HW1 Practice Solutions	10/3 Directed Graphs/ DAGs/ SCCs (3.3, 3.4) 101F24_day3_DAGs_SCCs.pdf 101F24_day3_DAGs_SCCs_annotated.pdf	10/4 HW1 due HW1.zip HW Solutions	10/5	10/6
2	10/7	10/8 Reductions/ Modifications/ Proofs (Related to chapter 3.) 101F24_day4_graph_reductions.pdf 101F24_day4_graph_reductions_annotated.pdf HW2 practice questions.pdf HW2 practice solutions.pdf	10/9	10/10 BFS/Dijkstra's/Priority Queues (4.1, 4.2, 4.3, 4.4) 101F24_day5_BFS_shortest_path.pdf 101F24_day5_BFS_shortest_path_annotated.pdf	10/11 HW2 due HW2.tex HW2_solutions.pdf	10/12	10/13
3	10/14	10/15 MSTs Applications of priority queues: Prim's (4.4, 4.5, 5.1) 101F24_day6_Priority_Queues_MSTs-1.pdf 101F24_day6_Priority_Queues_MSTs_annotated.pdf practice hw3.pdf practice hw3 solution.pdf	10/16	10/17 Kruskal's and Union Find (5.1) 101F24_day7_Kruskal-1.pdf 101F24_day7_Kruskal_annotated.pdf	10/18 HW3_updated.pdf HW3_updated.zip HW3_updated.tex HW3_solutions.pdf ptest1f24.pdf ptest1f24_solutions.pdf	10/19	10/20
4	10/21	10/22 Greedy Algorithms Exchange Arguments (ch. 4 K-T text) 101F24_day8_Greedy_exchange_argument.pdf 101F24_day8_Greedy_exchange_argument_annotated.pdf	10/23	10/24 Test 1 (graph algorithms)	10/25 No homework	10/26	10/27
5	10/28	10/29 Greedy Stays ahead Greedy approximation algorithms (ch. 4 K-T text) 101F24_day9_Greedy_proof_strategies.pdf 101F24_day9_Greedy_proof_strategies_annotated.pdf	10/30	10/31 Divide and conquer Analysis: Master Theorem Application: Multiply (2.1, 2.2) 101F24_day10Divide_and_conquer.pdf 101F24_day10Divide_and_conquer_annotated.pdf	11/1 HW4 due 101hw4F24_updated.pdf 101hw4F24_updated.tex 101hw4F24_solutions.pdf prac4main.pdf prac4solutions.pdf	11/2	11/3
6	11/4	11/5 Divide and Conquer Application: Sort and Select 101F24_day11Divide_and_conquer_2.pdf 101F24_day11Divide_and_conquer_2_annotated.pdf 101hw5_Prac.pdf 101hw5_Pracsol.pdf	11/6	11/7 Divide and conquer, Backtracking (AKA decrease and conquer) (Related to chapter 6) 101F24_day12_Backtracking.pdf 101F24_day12_Backtracking_annotated.pdf	11/8 HW5 due 101hw5F24.tex 101hw5F24_solutions.pdf	11/9	11/10
7	11/11 Veterans day	11/12 Converting Backtracking to Dynamic Programming (ch. 6) 101F24_day13_DP_1.pdf 101F24_day13_DP_annotated.pdf	11/13	11/14 Test 2	11/15	11/16	11/17
8	11/18	11/19 Dynamic programming (ch. 6) 101F24_day14_DP_2.pdf 101F24_day14_DP_2_ANNOTATED.pdf HW6_practice.pdf HW6_practice_sol.pdf	11/20	11/21 Graph Dynamic Programming (ch 6, 4.6) 101F24_day15_DP_graphs.pdf 101F24_day15_DP_graphs_annotated.pdf	11/22 HW6 due 101hw6F24.tex 101hw6F24_solutions.pdf	11/23	11/24
9	11/25	11/26 More DP practice LP/Iterative Improvement 101F24_day16_DP_networkflow.pdf 101F24_day16_DP_networkflow_annotated.pdf HW7_practice.pdf HW7_practice_sol.pdf	11/27	11/28 (Thanksgiving)	11/29 (Black Friday)	11/30	12/1
10	12/2	12/3 network flow P/NP 101F24_day17_networkflow_P_NP.pdf 101F24_day17_networkflow_P_NP_annotations.pdf HW7due 101hw7F24.tex HW7_solution.pdf (7.1, 7.2)	12/4	12/5 P/NP (ch 8) 101F24_day18_P_NP.pdf 101F24_day18_P_NPannotated.pdf Final_practice.pdf Final_practice_sol.pdf	12/6	12/7	12/8
Finals	12/9	12/10	12/11	12/12	12/13 Final Exam (11:30am-2:29pm)	12/14	12/15