|
08/26 |
Review of Necessary Mathematics |
Notation. Functions. Mathematical Induction. |
|
08/28 |
Review of Necessary Mathematics |
Logarithms. Sets. Permutations and combinations. Probability. |
|
09/02 |
Algorithms:
Efficiency, Analysis, and Order (HW 1 Due) |
Algorithms. Analysis and efficiency of algorithms. |
|
09/04 |
Algorithms: Efficiency, Analysis, and Order (Quiz 1) |
Analysis (cont). |
|
09/09 |
Algorithms: Efficiency, Analysis, and Order |
Complexity and Order. |
|
09/11 |
Solving Recurrence Equations |
Solving recurrences using induction, characteristic equations. |
|
09/16 |
Solving Recurrence Equations (HW 2 Due) |
Homework review |
|
09/18 |
Solving Recurrence Equations (Quiz 2) |
Solving recurrences by substitution. Extending results. |
|
09/23 |
Divide-and-Conquer |
Definition. Binary search. Merge sort. |
|
09/25 |
Divide-and-Conquer |
Quick sort. Strassen’s matrix multiplication. Large numbers’ arithmetic. |
|
09/30 |
Divide-and-Conquer (HW 3 Due) |
Determining thresholds. When not to use D-a-C. |
|
10/02 |
Dynamic Programming (Quiz 3) |
The binomial coefficient. |
|
10/07 |
Dynamic Programming |
Binomial coefficient (cont.). Floyd’s algorithm for shortest paths. |
|
10/09 |
Dynamic Programming |
Floyd’s algorithm (cont.). Chained matrix multiplication. |
|
10/14 |
Dynamic Programming (HW 4 Due) |
Optimal binary search trees. The traveling salesperson problem. |
|
10/16 |
The Greedy Approach (Quiz 4) |
Minimum spanning trees.
Dijkstra’s algorithm for shortest paths. |
|
10/21 |
Midterm Review (HW 5 Due) (Quiz 5) |
|
|
10/23 |
Midterm 1 |
Algorithms. Divide-and-Conquer. Dynamic Programming. |
|
10/28 |
Midterm Review |
|
|
10/30 |
The Greedy Approach |
Minimum spanning trees. Dijkstra’s algorithm for shortest paths. |
|
11/04 |
The Greedy Approach |
Scheduling. Huffman code. Greedy vs. DP. |
|
11/06 |
Backtracking |
Definition. The n-queens problem. Estimating efficiency. |
|
11/11 |
Backtracking (HW 6 Due) |
The sum-of-subsets problem. Graph coloring. |
|
11/13 |
Backtracking (Quiz 6) |
Hamitonian circuits. The 0-1 knapsack problem. |
|
11/18 |
Branch-and-Bound (HW 7 Due) |
Definition. The traveling sales person problem. |
|
11/20 |
Branch-and-Bound (Quiz 7) |
The TSP (cont.). Abductive inference. |
|
11/25 |
Intro to Computational Complexity |
Definitions. Insertion and selection sort. Lower bounds. Revisiting other sort algorithms. Heapsort. |
|
11/27 |
No Class – Thanksgiving |
|
|
12/02 |
More Computational Complexity (HW 8 Due) |
Radix sort. Comparison between sorting strategies. Lower bounds for sorting algorithms. |
|
12/04 |
More Computational Complexity (Quiz
8) |
Lower bounds for searching algorithms. Interpolation search. Searching in trees. Hashing. |
|
12/09 |
Final Exam |
Comprehensive. |