Algorithms (CSCI 2200)

Classes: 9/5, 9/10-morn, 9/10-aft, 9/12

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 (9/12):Asymptotic Analysis

Classes: 9/17-morn, 9/17-aft, 9/19, 9/24-morn, 9/24-aft

Classes: 9/26, 10/1-morn, 10/1-aft

Classes: 10/3

Classes: 10/8-morn

Classes: 10/8-aft, 10/10

Classes: 10/17, 10/22-morn):

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

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

Classes: 10/24, 10/29-morn, 10/29-aft

Classes: 10/31, 11/5-morn, 11/5-aft

Topics: Dynamic Programming: 0-1 Knapsack, Weighted Interval Scheduling, Longest Common Subsequence,
Reading: CLRS 15.1, 15.4
Lab 7 (11/5-aft): Dynamic Programming

Classes: 11/7, 11/12-morn

Classes 11/12-aft, 11/14, 11/19-morn

Topics: Graphs: graph basics and traversals (BFS, DFS). Traversal applications. Topological Sort.
Reading: CLRS 22.1 - 22.3
Lab 9 (11/19-morn): Graphs

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

Classes: 11/21, 11/26-morn, 11/26-aft:

Classes: 12/3-morn, 12/3-aft, 12/5

Topics: Minimum Spanning Trees: Prim-Jarnik, Kruskal's, Union-Find structure.
Reading: CLRS 23
Lab 11 (12/5): Graphs (Minimum Spanning Trees)

Classes 12/10-morn, 12/10-aft

Exam 3: Tuesday, December 17, 8:30 - 11:30 am in Searles 126: emphasis on graphs.