Algorithms (CSCI 2200)

Week 1 (8/29, 9/3, 9/4, 9/5):

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 (9/10, 9/11, 9/12):

Week 3 (9/17, 9/18, 9/19):

Week 4 (9/24, 9/25, 9/26):

Week 5 (10/1, 10/2, 10/3):

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

Week 6 (10/10, 10/15, 10/16):

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 (10/17, 10/22, 10/23):

Week 8 (10/24, 10/29, 10/30):

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

Week 9 (10/31, 11/5, 11/6):

Week 10 (11/7, 11/12, 11/13):

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

Exam 2: Tuesday, 11/13 (in-class): emphasis on selection, divide-and-conquer, dynamic programming, and greedy algorithms.

Week 11 (11/14, 11/19, 11/20):

Week 12 (11/26, 11/27, 11/28)

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

Week 13 (12/3, 12/4, 12/5)

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