CPSC 327 Syllabus

Week 1: 1/16-1/20

Topics: introduction; algorithm analysis

Reading: GT (Goodrich & Tamassia) ch 1.1-1.4, 1.6

Do the readings before coming to class, so that class time can be spent on addressing questions and trickier topics.

Week 2: 1/23-1/27

Topics: running time of stacks, queues, vectors, lists, sequences; introduction to searching/lookup, hash tables

Reading: GT 2.1-2.2, 1.5 (Mon); GT 2.5 (Wed)

Week 3: 1/30-2/3

Topics: binary search trees and balanced binary trees: AVL trees, 2-4 trees

Reading: GT 3.1.1-3.1.6, 2.3 (Mon); GT 3.2 (Wed); GT 3.3.2 (Fri)

Week 4: 2/6-2/10

Topics: more balanced binary trees and efficient ordered dictionary implementations: 2-4 trees, splay trees, skip lists

Reading: GT 3.3.2 (Mon); GT 3.4 (Mon); 3.5 (Wed)

Week 5: 2/13-2/17

Topics: better-than-quadratic sorting

Reading: GT 4.1, 4.3 (Mon); 4.4-4.6 (Wed); 4.7 (Fri)

Examples:

• comparison of quadratic sorts, randomly-ordered input
• comparison of n log n sorts, randomly-ordered input
• comparison of "linear" sorts, randomly-ordered input
  note: radix is sorting numbers between 0 and 5000, using each digit
  note: bucket50000 is really bucket500000 (N = 500000)
• comparison of the best sorts of each class, randomly-ordered input
• comparison of quadratic sorts, on ordered, reverse-ordered, and randomly-ordered input
• comparison of n log n sorts, on ordered, reverse-ordered, and randomly-ordered input
• comparison of n log n sorts, on ordered, reverse-ordered, and randomly-ordered input (excluding the worst-case behavior for quicksort)
• comparison of "linear" sorts, on ordered, reverse-ordered, and randomly-ordered input

Week 6: 2/20-2/24

Topics: selection, greedy algorithms

Reading: GT 4.7 (Mon); 5.1 (Wed)

Week 7: 2/27-3/3

Topics: divide-and-conquer, recurrence relations

Reading: GT 5.2 (Mon)

Week 8: 3/6-3/10

Topics: divide-and-conquer

Reading:

Week 9: 3/20-3/24

Topics: dynamic programming

Reading:GT 5.3 (Mon)

Week 10: 3/27-3/31

Topics: graphs, graph implementations, graph traversal

Reading: GT 6.1, 6.2 (Mon), 6.3 (Wed)

Week 11: 4/3-4/7

Topics: directed graphs

Reading: GT 6.4 (Mon)

Week 12: 4/10-4/14

Topics: weighted graphs

Reading: GT 7.1 (Fri)

Week 13: 4/17-4/21

Topics: weighted graphs

Reading: GT 7.2 (Mon), 7.3 (Wed)

Week 14: 4/24-4/28

Topics: priority queues; P, NP, and NP completeness; backtracking and branch-and-bound

Reading: GT 2.4 (Mon); 13.1-13.3 (Wed); 13.5 (Fri)
Skim 13.2.2 and 13.3.

Week 15: 5/1-5/2

Topics: backtracking and branch-and-bound

Reading: 13.5 (Mon)

Reading Period & Final Exams: 5/6-5/9

last updated: --Wed Apr 26 17:45:37 EDT 2006--
page owned by: bridgeman@hws.edu