CSCI 256
Design and analysis of algorithms
Tentative Lecture and Reading Schedule

Spring, 2001

Day

Topic

Reading

Feb. 2

Introduction

1, 3, 5, 6.1-2

Feb. 5

Measuring Algorithm Performance 1

2

Feb. 7

Measuring Algorithm Performance 2

2, 4.1

Feb. 9

Measuring Algorithm Performance 3

4.1-3

Feb. 12

Union-Find

22.1-3

Feb. 14

Divide & Conquer: Sorting

7, 8

Feb. 16

No class (WINTER CARNIVAL)

Feb. 19

Lower bounds 1

9.1

Feb. 21

Lower bounds 2

Feb. 23

Median and Order statistics 1

10.1-2

Feb. 26

Median and Order statistics 2

10.3

Feb. 28

Solving Problems by Induction

Mar. 2

Divide and Conquer

Mar. 5

Dynamic programming 1

16.1-2

Mar. 7

Dynamic programming 2

16.2-3

Mar. 9

Greedy Algorithms 1

17.1-2

Mar. 12

Greedy Algorithms 2

17.2-3

Mar. 14

Amortized Analysis 1

18.1-2

Mar. 16

Amortized Analysis 2

18.2-3

******** Spring Break *****

Apr. 2

String Matching 1

34

Apr. 4

String Matching 2

Apr. 6

Graph Algos 1

23

Apr. 9

Graph Algos 2

23

Apr. 11

Graph Algos 3

23

Apr. 13

Minimum spanning tree

24

Apr. 16

Shortest Path Problems 1

25

Apr. 18

Shortest Path Problems 2

26

Apr. 20

Flow Networks 1

27.1-2

Apr. 23

Flow Networks 2

27.2

Apr. 25

Problem Reduction 1

Apr. 27

Problem Reduction 2

April 30

NP-Completeness 1

36

May 2

NP-Completeness 2

36

May 4

NP-Completeness 3

36

May 7

Parallel Algorithms 1

29

May 9

Parallel Algorithms 2

30 intro and 30.2

May 11

Parallel Algorithms 3

lecture notes