CPS 130 Algorithms ->Lectures

| Homework - Handouts - Teaching Assistants - Resources

 

Lecture Schedule and Notes

Duke Computer Science

Current homework is available from the homework page.

Date

Topics and Lecture Notes
(See below for color codes for credits for lecture notes)

Required Readings (from [CLRS] unless otherwise noted)

Tues, Aug 28

Overview of the course: Introduction to Algorithms
(SS) analyzing algorithms [PS]

[CLRS 1]

Thurs, Aug 30

Introduction to Algorithms
(JR) Models of Computation [PDF] [PS]
(JR) Computing Fibonacci Numbers [PDF] [PS]

Auxiliary notes:
(LA) Introduction to Algorithms [PS]

Optional notes:
(SS) Algorithm Design [PS]

[CLRS 1, 2]

Optional:
[GKP 1.1-1.2]

Tues, Sep 4

Asymptotic Analysis:
(SS) asymptotic notation [PS]

Auxiliary notes:
(LA) Growth of functions, summations [PS]

Optional notes:
(JR) Asymptotics and Recurrence Equations [PDF] [PS]

[CLRS Appendix A]

Optional:
[GKP 2.5]

Thurs, Sep 6

Recurrence Equations:
(SS) recurrence relations [PS]

Auxiliary notes:
(LA) Strassen's algorithm, Master method for recurrence [PS]

Optional notes:
(SS) Example Problems [PS]
(SS) More Example Problems [PS]

[CLRS 4.0-4.2, 4.3-4.4]

Optional:
[CLRS 28.1-28.2]

Tues, Sep 11

Lower Bounds on Sorting:
(LA) Lower bound in decision tree model, bucket and radix sort [PS]

Priority Queues:
(SS)