Algorithms (CSCI 2200)

Week 1 (1/22, 1/23, 1/28, 1/29):

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

Week 2 (1/30, 2/4, 2/5, 2/6):

Week 3 (2/11, 2/12, 2/13):

Week 4 (2/18, 2/19, 2/20):

Week 5 (2/25, 2/26, 2/27):

Exam 1: Wednesday, 2/27 (in-class): covers everything up to and including linear time sorting.

Week 6 (3/4, 3/5, 3/6):

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

Week 7 (3/25, 3/26, 3/27):

Week 8 (4/1, 4/2, 4/3):

Topics: Dynamic Programming: 0-1 Knapsack, Weighted Interval Scheduling, Longest Common Subsequence,
Reading: CLRS 15.1, 15.4
Lab 7: Dynamic Programming

Week 9 (4/8, 4/9, 4/10):

Week 10 (4/15, 4/16, 4/17):

Topics: Graphs: graph basics and traversals (BFS, DFS). Traversal applications. Topological Sort.
Reading: CLRS 22.1 - 22.3

Exam 2: Wednesday, 4/17 (in-class): emphasis on selection, divide-and-conquer, dynamic programming, and greedy algorithms.

Week 11 (4/22, 4/23, 4/24):

Week 12 (4/29, 4/30, 5/1)

Topics: Minimum Spanning Trees: Prim-Jarnik, Kruskal's, Union-Find structure.
Reading: CLRS 23
Lab: Lab 10: Graphs (Shortest Paths)

Week 13 (5/6, 5/7, 5/8)

Exam 3: Monday, May 13, 1:30 - 4:30 pm in Searles 126: emphasis on graphs.