Tentative Schedule

Classes: 1/21, 1/22, 1/23, 1/28 (Lab)

• Topics: Introduction. Simple (non-recursive) sorting. Asymptotic notation and analysis.
• Slides and Examples: Intro, Simple Sorting, and Asymptotic Analysis, Bubble Sort, Selection Sort, Insertion Sort
• Reading: CLRS 1, 2, 3
• Lab 1: Asymptotic Analysis

Classes: 1/29, 1/30, 2/4, 2/5, 2/6, 2/11 (Lab)

• Topics: Summations. Recurrences. Mergesort.
• Slides: MergeSort, Recurrences
• Reading: CLRS A, 2.3, 4.4
• Lab 2: Recurrences

• Topics: Quicksort. Heaps and Heapsort.
• Slides: QuickSort, Heaps and HeapSort
• Reading: CLRS 6, 7
• Lab 3: QuickSort, Heaps, and HeapSort

• Topics : Sorting lower bound. Sorting in linear time.
• Reading: CLRS 8
• Lab 4: Sorting

• Topics : Selection
• Reading: CLRS 8, 9

Classes: 2/27, 3/3, 3/4 (Lab 5):

• Topics: The Divide-and-Conquer Technique: (Maximum Partial Sum, Strassen).
• Reading: CLRS 4.1, 4.2
• Lab 5: Selection and Divide & Conquer

Classes: 3/24 CANCELLED

Classes: 3/25

• Topics: Intro to Remote Learning

Classes: 3/26, 3/31, 4/1, 4/2

• Topics: Dynamic Programming: BoardGame, 0-1 Knapsack
• Reading: CLRS 15.1, 15.4
• Lab 6: Dynamic Programming (assigned on 4/2, due on 4/9, graded by 4/14)

Classes: 4/7, 4/8, 4/9

• Topics: Graphs: graph basics and traversals (BFS, DFS), overview of Topological Sort.
• Reading: CLRS 22.1 - 22.3
• Lab 7: Graphs (assigned on 4/9, due on 4/16, graded by 4/21)

See email on 4/16 for remainder of semester.