Section

Topic

Problems

Class date

Ch. 0

 Prologue

0.2, 0.3

 +0.1, 0.2, 0.4(a),(b) (due Jan. 23)

Jan 12, 14, 16

Ch. 1

 Algorithms with numbers

1.1

Jan. 21, 23

1.2

1.3

Modular arithmetic, rec1.2.2-3

Primality testing, rec1.3

1.1, 1.9, +1.10, 1.11, 1.12, 1.20 (due Feb. 6)

Jan. 26, 28, 30

1.3, 1.4

1.5

Primality testing, Cryptography, rec1.3-4, RSAexample, Universal hashing

1.25, 1.27, 1.28, 1.29(a,b) (due Feb. 13)

Feb. 2, 4, 6

Ch. 2

 Divide-and-conquer algorithms

2.1

2.2

2.3

Multiplication,

Recurrence relations, rec2.1-2

Mergesort mergesortEx

+2.1, 2.4, 2.5(a,b,c,d), 2.14, 2.17 (due Feb. 20)

Feb. 9, 11, 13

2.4

Medians rec2.4

Feb. 16

Ch. 6

 Dynamic Programming

6.1

6.2

6.3

6.4

Shortest paths in dags, dag

Longest increasing subsequences

Edit distance, rec6.3, editDistEx

Knapsack, knapsackEx1, knapsackEx2

6.1, +6.2, 6.4, +6.8, 6.11, 6.22 (due Mar. 13)

Feb. 18, 20

Feb. 23, 25, 27

6.5

4.6, 4.7

6.7

6.6

Chain matrix multiplication, rec6.5-4.6

Shortest paths, Bellman-Ford-alg

Independent sets in trees

Shortest paths, pathEx

+4.2, 6.17, 6.21, 6.26 (due Mar. 20)

Mar. 9, 11, 13

6.6

Shortest paths, allpaths, TSP, rec6.6

Mar. 16

Ch. 7

 Linear Programming

7.1

Introduction, rec7.1, LPex1.m

7.1, 7.2, +7.3, 7.4 (due Mar. 27)

Mar. 18, 20

7.2

7.3

7.4

Flows in networks rec7.2

Bipartite matching, BiPaMatching

Duality, DualityEx

7.10, 7.11, 7.12, +7.17 (due Apr. 3)

Mar. 23, 25, 27

Ch. 3

 Decompositions of Graphs

3.1

3.2

3.3

3.1, 3.2, 3.5, +3.7(a,b) (due Apr. 10)

Mar. 30, Apr. 1, 3

3.4

Strongly connected components rec3.4

3.3, 3.4, 3.14 (due Apr. 17)

Apr. 6

Ch. 4

 Paths in Graphs

4.1

4.2

4.3

4.4

Distances

Breadth-first search

Lengths on edges

Dijkstra's algorithm

+4.1, +4.2, +4.6 (due Apr. 17)

Apr. 8, 10

Ch. 5

 Greedy algorithms

5.1

Minimum spanning trees rec5.1

+5.1, +5.2, +5.3 (due Apr. 24)

Apr. 13, 15, 17

Review

Apr. 20, 22, 24

Review recReview

Apr 27

Final Exam

Time:  13:00 - 15:00

May 6