Lecture notes/slides will be uploaded during the course. sumMotifScores.txt Motivation, steps for algorithm design

Week 1

lect1.ppt Motivation, steps for algorithm design

Week 2

lect2.ppt problem types and data structures

lect3.ppt Theoretical Analysis of Time Efficiency

Week 3

lect4.ppt Running time analysis, non-recursive algo

lect5.ppt Running time, recursive algorithm

Week 4

lect6.ppt Homogeneous Second-Order Linear Recurrence, brute-force algorithm

lect7.ppt brute force strategy, TSP, assignment, sorting

Week 5

lect8.ppt Divide and conquer, mergesort, quicksort

lect9.ppt Divide and conquer

Week 6 09/22, 09/24

lect10.ppt

Week7

midterm1

lect11.ppt Divide and conquer: Closest-Pair Problem, convex-hull

Week8 10/06

Midterm1 discussion

Week9 10/13, 10/15

lect12.ppt Decrease and conquer. a^n

lect13.ppt DFS

Week10 10/20, 10/22

lect13.ppt BFS and Topological sorting

lect14.ppt ch6a

Week11 10/27, 10/29

lect15.ppt ch6b

Midterm2

Week12 11/03, 11/05

No class on 11/03

lect16.ppt

Week13 11/10, 11/12

lect17.ppt

lect18.ppt

Week14 11/17, 11/19

lect19.ppt

Week15 11/24

lect20.ppt

Week15 12/01

lect21.ppt

lect22.ppt