CPSC 327 Syllabus

Week 1: 1/20-1/23

Topics: introduction, developing iterative algorithms

• ADM sections 1.1-1.2 (including chapter introduction)

Slides:

• course introduction

• ADM sections 1.3.1-1.3.4 (including introduction to section 1.3)

Slides and Examples:

• developing iterative algorithms
• developing insertion sort using the 16 steps

Week 2: 1/26-1/30

Topics: developing iterative algorithms, greedy algorithms

• hw 1 #2 (graph coloring problem)
• using making progress and loop invariants to establish the correctness of insertion sort pseudocode
• narrowing the search space example - binary search

• hw 1 comments, patterns for iterative algorithms
• narrowing the search space example - sorted matrix

• hw 2 comments, greedy algorithms
• greedy example - event scheduling

Week 3: 2/2-2/6

Topics: greedy algorithms

• hw 3 comments
• iterative example - multiplication
• greedy example - driving to Seattle

• greedy algorithm comments, process recap
• greedy example - callers on hold

• tackling "maintain invariant"
• greedy example - popular CD
• greedy example - rural electrification
• greedy example - print jobs

Week 4: 2/9-2/13

Topics: analysis of algorithms

• ADM section 1.3.5
• ADM sections 2.1-2.8 (including introduction to chapter 2)
• (optional) ADM section 2.9

Reference:

• Big Oh for sums

Week 5: 2/16-2/20

Topics: basic data structures and ADTs, balanced binary trees

• ADM sections 3.1-3.4 (including introduction to chapter 3)

• analysis of algorithms
• basic data structures and ADTs

• AVL trees (balanced binary search trees)

Week 6: 2/23-2/27

Topics: data structures (hashtables, priority queues, heaps)

• ADM section 3.7

Slides:

• 2-4 trees, red-black trees (optional), splay trees (optional) (balanced binary search trees)

• ADM section 3.5
• ADM sections 4.3.1-4.3.4
• (optional) ADM section 3.6

Slides:

• hashtables

• ADM sections 3.8-3.9

Slides and Examples:

• priority queues, heaps, and data structures wrapup
• partial solutions for hw #8
• partial solutions for hw #12

Week 7: 3/2-3/6

Topics: data structures wrapup, developing recursive algorithms, divide-and-conquer

• developing recursive algorithms
• reversing a linked list (example of developing a recursive algorithm using the steps)
• comments on hw #6
• partial solutions for hw #10
• partial solutions for hw #13

• ADM section 4.5
• ADM sections 4.6.1-4.6.3
• ADM section 4.10 (introduction only)

Slides and Examples:

• solving recurrence relations, recursive patterns, divide-and-conquer
• reversing a linked list (updated with runnning time)
• finding min (developing a recursive algorithm)

• ADM sections 4.10.1-4.10.3

Slides and Examples:

• comments on developing recursive algorithms (the steps), divide-and-conquer
• mergesort (using the more of the input divide-and-conquer development pattern)
• quicksort (using the more of the output divide-and-conquer development pattern)

Week 8: 3/9-3/13

Topics: divide-and-conquer

• solving recurrence relations (unwinding), randomized quicksort running time
• practice problems - solving recurrence relations (not collected or graded)

• median of medians (a good pivot for quicksort?)
• selection
• tiling

• skyline problem
• counting inversions
• finding a majority element

Spring Break: 3/16-3/20

Week 9: 3/23-3/27

Topics: graphs and graph algorithms

• ADM sections 5.1-5.4 (including the introduction to chapter 5)

Slides:

• graphs, Graph ADT, edge list implementation

• ADM sections 5.5-5.10

Slides:

• adjacency list and adjacency matrix implementations, traversal, reachability

• DFS/BFS-based graph algorithms: shortest path, cycles, Euler circuit, biconnectivity/cut vertices
• exam 1 comments

Week 10: 3/30-4/3

Topics: graph algorithms

• ADM sections 6.1-6.4 (including the introduction to chapter 6)

Slides:

• graph algorithms: bipartite/two-coloring, strongly connected components, topological sort, Dijkstra's algorithm

• graph algorithms: Dijkstra's algorithm (running time), Bellman-Ford, shortest paths in DAGs, Kruskal's algorithm

• graph algorithms: union-find implementation, Prim's algorithm
• solving problems with graphs: water pouring, course prerequisites

Week 11: 4/6-4/10

Topics: using graphs to solve problems; recursive backtracking, pruning

• ADM section 6.6, plus review sections 6.1 and 6.4

Slides:

• solving problems with graphs

Reference:

• ADM chapters 15-16

• ADM section 7.1 (including the introduction to chapter 7)

Slides:

• exhaustive search and recursive backtracking

• ADM sections 7.2-7.4

Slides:

• recursive backtracking

Week 12: 4/13-4/17

Topics: branch and bound, dynamic programming

• branch and bound

• ADM sections 8.1-8.5 (including the introduction to chapter 8)

Slides:

• branch and bound
• introduction to dynamic programming

• dynamic programming

Week 13: 4/20-4/24

Topics: dynamic programming, reductions

• ADM section 8.7

Slides:

• dynamic programming

• dynamic programming

• ADM sections 9.1-9.8 (including the introduction to chapter 9)

Slides and Examples:

• dynamic programming
• challenges problem
• shuffle problem
• reductions

Week 14: 4/27-5/1

Topics: complexity; The Hitchhiker's Guide to Algorithms

• ADM sections 9.9-9.10

Slides:

• complexity

• complexity

• ADM chapter 10
• browse through Part II of ADM - get a sampling of what's there

Slides:

• how to design algorithms and data structures

Week 15: 5/4-5/5

Topics: The Hitchhiker's Guide to Algorithms

• network flow

Reading Period: 5/6-5/8

Exams: 5/9-5/12

last updated: --Tue May 5 23:01:00 EDT 2015--
page owned by: bridgeman@hws.edu