YCP Logo Course Schedule

This page provides a tentative course schedule.

Date Topic Reading
1/22 - 1/24
Foundations

Intro to Algorithms
Insertion Sort



Ch. 1
Ch. 2.1-2.2
1/27 - 1/31 Asymptotic Notation
Changes due to cancellations will be discussed in class
Merge Sort
Ch. 3

Ch. 2.3
2/3 - 2/7 Master Theorem
Recurrence
Ch. 4.5
Ch. 4.3-4.4
2/10 - 2/14
Sorting and Order Statistics

HeapSort
QuickSort



Ch. 6
Ch. 7
2/17 - 2/21

Linear Sorting

EXAM I/II - 2/21
Ch. 8
2/24 - 2/28
Probabilistic Analysis

Indicator Random Variables
Hiring Problem
Hash Tables



Ch. 5.2
Ch. 5.1
Ch. 11.1-11.3
3/3 - 3/7
NO CLASS - WINTER BREAK
 
3/10 - 3/14
Dynamic Programming

Rod Cutting
Longest Common Subsequence



Ch. 15.1
Ch. 15.4
3/17 - 3/21 Activity Selection
Greedy Algorithms
Ch. 16.1
Ch. 16.2
3/24 - 3/28
Graph Algorithms

Graph Theory

EXAM III - 3/26

Breadth First Search



Apx B.4



Ch. 22.2
3/31 - 4/4 Depth First Search
DFS Applications MST - Kruskal's Algorithm
Ch. 22.3
Ch. 22.4-22.5
Ch. 23
4/7 - 4/11

MST - Prim's Algorithm
SSSP - Bellman-Ford

EXAM IV - 4/11
Ch. 23
Ch. 24.1
4/14 - 4/18

SSSP - Dijkstra's Algorithm
APSP - Floyd-Warshall Algorithm

NO CLASS APRIL 18 - SPRING BREAK
Ch. 24.3
Ch. 25.2
4/21 - 4/25
NO CLASS APRIL 21 - SPRING BREAK

Maximal Flow
Ford-Fulkerson Algorithm



Ch. 26.1
Ch. 26.2
4/28 - 5/2
NP-Completeness

NP-Completeness Intro
NP-Complete Problems
More NP-Complete Problems

EXAM V - 5/2


Ch. 34.1-34.3
Ch. 34.4
Ch. 34.5

5/5 - 5/7 Approximation Algorithms Ch. 35.1-35.2
5/12 - 5/16
May 12 - 10:15-12:15 Final Reports and Presentations