| Wk |
Day |
Date |
Topic | Resources | Events |
|
| 1 | Tue | Sep 01 | Introduction | You can learn anything video
Selective Soldering Machine
Pick and Place Machine | |
|
|
| Thu | Sep 03 | Algorithms | AIDMA "How To"
AIDMA Ch 1
IDAA 1.1-1.3 | Assignment 0 due |
|
|
| Fri | Sep 04 | Data StructuresGraphs | IDAA 1.4
AIDMA 10 (yes, ten) | HW 1 due |
|
| 2 | Tue | Sep 08 | Proofs | AIDMA 2.1-2.3 | |
|
|
| Thu | Sep 10 | Proofs | AIDMA 2.4-2.8 | HW 2 due |
|
|
| Fri | Sep 11 | Programming Fundamentals and Algorithms | AIDMA 3.1-3.6 | |
|
| 3 | Tue | Sep 15 | Propositional Logic | AIDMA 4.1-4.2 | HW 3 due |
|
|
| Thu | Sep 17 | Predicates
Quantifiers
Normal Forms
Bitwise Operations | AIDMA 4.3-4.5 | HW 4 due |
|
|
| Fri | Sep 18 | Sets | AIDMA 5.1-5.2 | |
|
| 4 | Tue | Sep 22 | Functions, Partitions, and Equivalence Relations | AIDMA 5.3-5.4 | HW 5 due |
|
|
| Thu | Sep 24 | Sequences | AIDMA 6.1 | HW 6 due |
|
|
| Fri | Sep 25 | Summations and Products | AIDMA 6.2 | |
|
| 5 | Tue | Sep 29 | Asymptotic Notation | AIDMA 7.1
IDAA 2.2 (No SRQ) | HW 7 due |
|
|
| Thu | Oct 01 | Growth Rates
Algorithm Analysis | AIDMA 7.2-7.3 | |
|
|
| Fri | Oct 02 | Algorithm Analysis | IDAA 2.1,2.3 (SRQ!) | |
|
| 6 | Tue | Oct 06 | No Class | | Fall Recess |
|
|
| Thu | Oct 08 | Mathematical Induction | AIDMA 8.1 | HW 8 due |
|
|
| Fri | Oct 09 | Recursion and Solving Recurrence Relations | AIDMA 8.2-8.3.3IDAA Appendix B (optional) | HW 9 due |
|
| 7 | Tue | Oct 13 | Analysing Recursive Algorithms | AIDMA 8.3.4-8.4
IDAA 2.4-2.5 (SRQ!) | HW 10 due |
|
|
| Thu | Oct 15 | Catch up/review | | HW 11 due |
|
|
| Fri | Oct 16 | AIDMA 1-8, 10
IDAA 1-2 | | Midterm Exam |
|
| 8 | Tue | Oct 20 | Basic Counting | AIDMA 9.1-9.2 | |
|
|
| Thu | Oct 22 | Permutations and Combinations | AIDMA 9.3 | |
|
|
| Fri | Oct 23 | Binomial Theorem and Inclusion-Exclusion | AIDMA 9.4-9.5 | HW 12 due |
|
| 9 | Tue | Oct 27 | Brute Force | IDAA 3.1, 3.2, 3.4
Basic Sorting Algorithms Notes | HW 13 due |
|
|
| Thu | Oct 29 | Exhaustive Search, BFS, and DFS | IDAA 3.5
BFS and DFS Notes
Data Structure Visualizations | |
|
|
| Fri | Oct 30 | Decrease-and-Conquer | IDAA 4.1-4.2
Basic Sorts (see Insertion Sort)
BFS and DFS Notes (see Topological Sort)
Data Structure Visualizations (See two Topological Sort ones) | |
|
| 10 | Tue | Nov 03 | Decrease-by-a-Constant-Factor | IDAA 4.4 | HW 14 due |
|
|
| Thu | Nov 05 | Variable-Size-Decrease | IDAA 4.5 | |
|
|
| Fri | Nov 06 | Divide-and-Conquer | IDAA 5.1-5.2
Quicksort Notes
Merge Sort Notes | |
|
| 11 | Tue | Nov 10 | Tree Traversal and Matrix Multiplication | IDAA 5.3-5.4
Strassen's Algorithm Notes
Sorting Worst Case | HW 15 due |
|
|
| Thu | Nov 12 | Transform-and-Conquer | IDAA 6.1-6.2
LU Decomposition Example | |
|
|
| Fri | Nov 13 | Transform-and-Conquer | IDAA 6.4-6.5
Heapsort Notes | |
|
| 12 | Tue | Nov 17 | Problem Reduction | IDAA 6.6
Reduction Examples | HW 16 due |
|
|
| Thu | Nov 19 | Space-Time Trade-offs | IDAA 7.1-7.2 (through page 262) | |
|
|
| Fri | Nov 20 | Dynamic Programming | IDAA 8.1
Fibonacci Demo
Recursive Functions (Fibonacci)
Dynamic Programming Notes | |
|
| 13 | Tue | Nov 24 | Dynamic Programming | IDAA 8.2 | HW 17 due |
|
|
| Thu | Nov 26 | No Class | Turkey (or Tofurky or maybe even Turducken)
Stuffing
Mashed Potatoes
Gravy | Thanksgiving Break |
|
|
| Fri | Nov 27 | No Class | | Thanksgiving Break |
|
| 14 | Tue | Dec 01 | Dynamic Programming | IDAA 8.4
Warshall's Algorithm Notes
Floyd's Algorithm Demo | |
|
|
| Thu | Dec 03 | Greedy Algorithms | IDAA 9.1-9.2
MST Notes
Animations (See Prim's and Kruskal's) | HW 18 due |
|
|
| Fri | Dec 04 | Greedy Algorithms | IDAA 9.4
Greedy Algorithms Notes | Exam Problem due |
|
| 15 | Tue | Dec 08 | P, NP, and NP-Complete | IDAA 11.3
P, NP, and NP-Complete Notes | |
|
|
| Thu | Dec 10 | Quantum Computing | Quantum Computing Notes
Quantum Computation Introduction (A little more in depth) | HW 19 due |
|
|
| Fri | Dec 11 | Review | | |
|
| Ex | Tue | Dec 15 | Everything | | Final Exam 9-11 am |