CSCI 255 Fall 2023Introduction to Algorithms and Discrete Structures Archived Class
 previous     next today     future     all

Schedule for weeks 1 through 16

 Wk Day Date Topic Resources Events 1 Wed Aug 30 Algorithms Tips for learning Assignment 0 Growth Mindset posters AIDMA "How To" IDAA 1.1 IDAA 1.2 IDAA 1.3 IDAA 1.1-1.3 RQs due (shared google doc) Fri Sep 01 Propositional Logic AIDMA 2.1-2.2 AIDMA 2.1-2.2 Exercises, RQs due Assignment 0 due 2 Mon Sep 04 Predicates and Quantifiers AIDMA 2.3 HW 1 due AIDMA 2.3 Exercises, RQs due Wed Sep 06 Sets AIDMA 4.1-4.1.2 AIDMA 4.2 AIDMA 4.1.1, 4.1.2, 4.2 Exercises, RQs due Fri Sep 08 Functions AIDMA 4.3-4.3.1 AIDMA 4.3.1 Exercises, RQs due HW 1 due (Second problem redo) 3 Mon Sep 11 Programming Fundamentals Algorithms AIDMA 5.1-5.7, 5.9 HW 2 due AIDMA 5.1-5.7, 5.9 Exercises, RQs due Wed Sep 13 Sequences AIDMA 6.1 HW 3 due AIDMA 6.1 Exercises, RQs due Fri Sep 15 Summations Products AIDMA 6.2 AIDMA 6.2 Exercises, RQs due HW 4 due 4 Mon Sep 18 Asymptotic Notation AIDMA 7.1IDAA 2.2 AIDMA 7.1 Exercises, RQs dueIDAA 2.2 RQs due Wed Sep 20 Growth RatesAlgorithm Analysis AIDMA 7.2-7.3 HW 5 due AIDMA 7.2-7.3 Exercises, RQs due Fri Sep 22 Algorithm Analysis IDAA 2.1 IDAA 2.3 IDAA 2.1, 2.3 RQs due 5 Mon Sep 25 Mathematical Induction AIDMA 8.1 HW 6 due AIDMA 8.1 Exercises, RQs due Wed Sep 27 No Class CIS Fri Sep 29 Recursion Solving Recurrence Relations AIDMA 8.2-8.3.3IDAA Appendix B (optional) HW 7 due (problem 1) AIDMA 8.2-8.3 Exercises, RQs due 6 Mon Oct 02 Analyzing Recursive Algorithms AIDMA 8.3.4-8.4 IDAA 2.4-2.5 HW 7 due (problem 2) AIDMA 8.4 Exercises, RQs due IDAA 2.4-2.5 RQs due Wed Oct 04 Data StructuresGraphs AIDMA 10 IDAA 1.4 AIDMA 10 Exercises, RQs due IDAA 1.4 RQs due Midterm Self Evaluation due Fri Oct 06 More Solving Recurrences Analyzing Recursive Algorithms 7 Mon Oct 09 No Class Fall Recess Wed Oct 11 Catch up/review Sample midterm exam HW 8 due Fri Oct 13 AIDMA 1-10 (not 3 or 9) IDAA 1-2 Midterm Exam 8 Mon Oct 16 Brute Force: Sorting and Searching IDAA 3.1 IDAA 3.2 IDAA 3.1, 3.2 RQs due Wed Oct 18 Exhuastive Search IDAA 3.4 Basic Sorting Algorithms Notes HW 9 due IDAA 3.4 RQs due Fri Oct 20 BFS DFS IDAA 3.5 BFS and DFS Notes Data Structure Visualizations IDAA 3.5 RQs due 9 Mon Oct 23 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) HW 10 due IDAA 4.1-4.2 RQs due Wed Oct 25 Decrease-by-a-Constant-Factor IDAA 4.4 Watch Josephus Problem Video IDAA 4.4 RQs due Fri Oct 27 Variable-Size-Decrease IDAA 4.5 IDAA 4.5 RQs due 10 Mon Oct 30 Divide-and-Conquer Mergesort Quicksort IDAA 5.1 IDAA 5.2 Quicksort Notes Merge Sort Notes HW 11 due IDAA 5.1-5.2 RQs due Wed Nov 01 Divide-and-Conquer Tree Traversal IDAA 5.3 BST Notes IDAA 5.3 RQs due Fri Nov 03 Divide-and-Conquer Matrix Multiplication IDAA 5.4 Strassen's Algorithm Notes Sorting Worst Case IDAA 5.4 RQs due 11 Mon Nov 06 Transform-and-Conquer Presorting Balanced Trees IDAA 6.1 IDAA 6.3 AVL Tree Demo B-Tree Demo HW 12 due IDAA 6.1, 6.3 RQs due Wed Nov 08 Transform-and-Conquer Heaps and Heapsort IDAA 6.4 Heapsort Notes IDAA 6.4 RQs due Fri Nov 10 Transform-and-Conquer Horner's Rule Binary Exponentiation IDAA 6.5 IDAA 6.5 RQs due 12 Mon Nov 13 Space-Time Trade-offs Counting Sort Radix Sort IDAA 7.1 HW 13 due IDAA 7.1 RQs due Wed Nov 15 Space-Time Trade-offs String Matching IDAA 7.2 (through page 262) IDAA 7.2 RQs due Fri Nov 17 Dynamic Programming Coin Problems Fibonacci Numbers Matrix Chain Multiplication IDAA 8.1 Dynamic Programming Notes Fibonacci Demo Recursive Functions (Fibonacci) IDAA 8.1 RQs due 13 Mon Nov 20 Dynamic Programming Knapsack Problem IDAA 8.2 Dynamic Programming Notes IDAA 8.2 RQs due Wed Nov 22 Bolschitz Algorithm HW 14 due Fri Nov 24 No Class Thanksgiving Break 14 Mon Nov 27 Dynamic Programming Floyd's and Warshall's Algorithms IDAA 8.4 Warshall's Algorithm Notes (Read) Floyd's Algorithm Demo IDAA 8.4 RQs due Wed Nov 29 Greedy Algorithms Prim's algorithm IDAA 9.1 MST Notes Animations (See Prim's and Kruskal's) Algoraph IDAA 9.1 RQs due Fri Dec 01 Greedy Algorithms Kruskal's algorithm IDAA 9.2 (through page 327â€”the rest is interesting, but optional) MST Notes Animations (See Prim's and Kruskal's) Algoraph IDAA 9.2 RQs due 15 Mon Dec 04 Greedy Algorithms IDAA 9.4 Greedy Algorithms Notes IDAA 9.4 RQs due Wed Dec 06 Quantum Computing An Introduction to Quantum Computing and Quantum Error Correction Quantum Computing: How to do 2n things all at once HW 15 due Fri Dec 08 Review Ex Wed Dec 13 Everything Sample Final Final Exam 12:30-2:30pm