| Wk |
Day |
Date |
Topic | Resources | Events |
|
| 1 | Mon | Aug 17 | Introduction | You can learn anything video
Tips for learning
Growth Mindset posters
Assignment 0 | |
|
|
| Wed | Aug 19 | Algorithms | AIDMA "How To"
AIDMA Ch 1
IDAA 1.1
IDAA 1.2
IDAA 1.3 | Assign 0 due←submit here as PDF
IDAA 1.1-1.3 RQs due (shared google doc) |
|
|
| Fri | Aug 21 | Proofs | AIDMA 2.1-2.3
xkcd: Proofs | AIDMA 2.1-2.3 Exercises, RQs due |
|
| 2 | Mon | Aug 24 | Proofs | AIDMA 2.4-2.8
10 rules of good/bad studying | HW 1 due
AIDMA 2.4-2.8 Exercises, RQs due |
|
|
| Wed | Aug 26 | Programming Fundamentals
Algorithms | AIDMA 3.1-3.6 | HW 2 due
AIDMA 3.1-3.6 Exercises, RQs due |
|
|
| Fri | Aug 28 | Propositional Logic | AIDMA 4.1-4.2 |
AIDMA 4.1-4.2 Exercises, RQs due |
|
| 3 | Mon | Aug 31 | Predicates
Quantifiers
Normal Forms
Bitwise Operations | AIDMA 4.3-4.5 | HW 3 due
AIDMA 4.3-4.5 Exercises, RQs due |
|
|
| Wed | Sep 02 | Sets | AIDMA 5.1-5.2 | AIDMA 5.1-5.2 Exercises, RQs due |
|
|
| Fri | Sep 04 | Functions
Partitions
Equivalence Relations | AIDMA 5.3-5.4 | HW 4 due
AIDMA 5.3-5.4 Exercises, RQs due
|
|
| 4 | Mon | Sep 07 | Sequences | AIDMA 6.1 |
AIDMA 6.1 Exercises, RQs due |
|
|
| Wed | Sep 09 | Summations
Products | AIDMA 6.2 | HW 5 due
AIDMA 6.2 Exercises, RQs due |
|
|
| Fri | Sep 11 | Asymptotic Notation | AIDMA 7.1
IDAA 2.2 | AIDMA 7.1 Exercises, RQs due
IDAA 2.2 RQs due |
|
| 5 | Mon | Sep 14 | Growth Rates
Algorithm Analysis | AIDMA 7.2-7.3 | HW 6 due
AIDMA 7.2-7.3 Exercises, RQs due |
|
|
| Wed | Sep 16 | No Class | | Fall Recess |
|
|
| Fri | Sep 18 | Algorithm Analysis | IDAA 2.1
IDAA 2.3 | HW 7 due
IDAA 2.1, 2.3 RQs due |
|
| 6 | Mon | Sep 21 | Mathematical Induction | AIDMA 8.1 |
AIDMA 8.1 Exercises, RQs due |
|
|
| Wed | Sep 23 | Recursion
Solving Recurrence Relations | AIDMA 8.2-8.3.3IDAA Appendix B (optional) | HW 8 due
AIDMA 8.2-8.3 Exercises, RQs due |
|
|
| Fri | Sep 25 | Analysing Recursive Algorithms | AIDMA 8.3.4-8.4
IDAA 2.4-2.5 |
HW 9 due (first problem)
AIDMA 8.4 Exercises, RQs due
IDAA 2.4-2.5 RQs due |
|
| 7 | Mon | Sep 28 | Catch up/review | Sample midterm exam | HW 9 due (second problem)
HW 10 due (can submit Friday) |
|
|
| Wed | Sep 30 | AIDMA 1-7
IDAA 1.1-1.3 | | Midterm Exam |
|
|
| Fri | Oct 02 | Basic Counting | AIDMA 9.1-9.2 | HW 10 due (hopefully you submitted it Monday, though)
AIDMA 9.1-9.2 Exercises, RQs due |
|
| 8 | Mon | Oct 05 | Permutations
Combinations | AIDMA 9.3 | AIDMA 9.3 Exercises, RQs due |
|
|
| Wed | Oct 07 | Binomial Theorem
Inclusion-Exclusion | AIDMA 9.4-9.5 | AIDMA 9.4-9.5 Exercises, RQs due |
|
|
| Fri | Oct 09 | Data StructuresGraphs | AIDMA 10
IDAA 1.4
| HW 11 due
AIDMA 10 Exercises, RQs due
IDAA 1.4 RQs due |
|
| 9 | Mon | Oct 12 | Brute Force | IDAA 3.1
IDAA 3.2
IDAA 3.4
Basic Sorting Algorithms Notes | HW 12 due
IDAA 3.1, 3.2, 3.4 RQs due |
|
|
| Wed | Oct 14 | Exhaustive Search
BFS
DFS | IDAA 3.5
BFS and DFS Notes
Data Structure Visualizations | HW 13 due
IDAA 3.5 RQs due |
|
|
| Fri | Oct 16 | Decrease-and-Conquer | IDAA 4.1
IDAA 4.2
Basic Sorts (see Insertion Sort)
BFS and DFS Notes (see Topological Sort)
Data Structure Visualizations (See two Topological Sort ones) | IDAA 4.1-4.2 RQs due |
|
| 10 | Mon | Oct 19 | Decrease-by-a-Constant-Factor | IDAA 4.4
Watch Josephus Problem Video | HW 14 due
IDAA 4.4 RQs due |
|
|
| Wed | Oct 21 | Variable-Size-Decrease | IDAA 4.5 | IDAA 4.5 RQs due |
|
|
| Fri | Oct 23 | Divide-and-Conquer | IDAA 5.1
IDAA 5.2
Quicksort Notes
Merge Sort Notes | IDAA 5.1-5.2 RQs due |
|
| 11 | Mon | Oct 26 | Tree Traversal
Matrix Multiplication | IDAA 5.3
IDAA 5.4
BST Notes
Strassen's Algorithm Notes
Sorting Worst Case | HW 15 due
IDAA 5.3-5.4 RQs due |
|
|
| Wed | Oct 28 | Transform-and-Conquer | IDAA 6.1
IDAA 6.3 | IDAA 6.1, 6.3 RQs due |
|
|
| Fri | Oct 30 | Transform-and-Conquer | IDAA 6.4
IDAA 6.5
Heapsort Notes | HW 16 due
IDAA 6.4, 6.5 RQs due |
|
| 12 | Mon | Nov 02 | Space-Time Trade-offs | IDAA 7.1
IDAA 7.2 (through page 262)
| IDAA 7.1-7.2 RQs due |
|
|
| Wed | Nov 04 | Dynamic Programming | IDAA 8.1
Dynamic Programming Notes
Fibonacci Demo
Recursive Functions (Fibonacci)
| IDAA 8.1 RQs due |
|
|
| Fri | Nov 06 | Dynamic Programming | IDAA 8.2 | HW 17 due
IDAA 8.2 RQs due
|
|
| 13 | Mon | Nov 09 | Dynamic Programming | IDAA 8.4
Warshall's Algorithm Notes (Read)
Floyd's Algorithm Demo | IDAA 8.4 RQs due |
|
|
| Wed | Nov 11 | Greedy Algorithms | IDAA 9.1
IDAA 9.2 (through page 327—the rest is interesting, but optional)
MST Notes
Animations (See Prim's and Kruskal's)
Algoraph | IDAA 9.1-9.2 RQs due |
|
|
| Fri | Nov 13 | Greedy Algorithms | IDAA 9.4 (RQs optional today!)
Greedy Algorithms Notes | HW 18 due
IDAA 9.4 RQs NOT due |
|
| Ex | Mon | Nov 16 | Review | | HW 19 due
|
|
|
| Fri | Nov 20 | Everything | | Final Exam
8-11 am |