Course Schedule

The following schedule is under development and subject to change. The course notes are (usually) available in two formats. The first format includes the questions that can be used to guide your learning. The second format omits the questions, making the notes more compact and perhaps better suited for reviewing. The compact format is available on the book web site. You can find the complete book here. It will be updated during the semester.

  1. Week 1

    Jan 12
    Overview and Introduction · Chapter 1
    Jan 13
    recitation Asymptotics and Divide and Conquer · Recitation Worksheet · Solutions
    Jan 14
    Genome Sequencing · Chapter 2
    Jan 16
    SignalLab out
    Review (TBA)
  2. Week 2

    Jan 19
    MLK Day - No Lecture
    Jan 20
    recitation Practice with Sequences · Recitation Worksheet · Solutions
    Jan 21
    Algorithm Analysis · Chapter 3
    Jan 23
    Sequences I · Chapter 4
  3. Week 3

    Jan 26
    SignalLab due
    SkylineLab out
    Sequences II · Chapter 4
    Jan 27
    recitation Scan · Recitation Notes
    Jan 28
    Contraction & Divide-and-Conquer · Chapter 5 · Chapter 6
    Jan 30
    Review (TBA)
  4. Week 4

    Feb 2
    SkylineLab due
    BignumLab out
    Maximum contiguous subsequence problem · Chapter 7
    Feb 3
    recitation TBA
    Feb 4
    Randomized Algorithms · Chapter 7
    Feb 6
    Review (TBA)
  5. Week 5

    Feb 9
    BignumLab due
    RandomLab out
    Quicksort · Chapter 7 (continued)
    Feb 10
    recitation TBA
    Feb 11
    Binary Search Trees and Treaps I · Chapter 15
    Feb 13
    Review (TBA)
  6. Week 6

    Feb 16
    RandomLab due
    Binary Search Trees and Treaps II · Chapter 15 (continued)
    Feb 17
    recitation TBA
    Feb 18
    Exam I Review
    Feb 20
    Exam I
  7. Week 7

    Feb 23
    Sets and Tables · Chapter 6
    BabbleLab out
    Feb 24
    recitation TBA
    Feb 25
    Ordered Sets and Augmented Trees · Chapter 16
    Feb 27
    Review (TBA)
  8. Week 8

    Mar 2
    BabbleLab due
    RangeLab out
    Graphs, Graph Representations, and Graph Search · Chapter 8
    Mar 3
    recitation TBA
    Mar 4
    BFS and Applications · Chapters 9-10
    Mar 6
    Mid-Semester Break - No Review
  9. Week 9

    Mar 9
    Spring Break - No Lecture
    Mar 10
    Spring Break - No Recitation
    Mar 11
    Spring Break - No Lecture
    Mar 13
    Spring Break - No Review
  10. Week 10

    Mar 16
    DFS and Applications · Chapter 11
    Mar 17
    recitation TBA
    Mar 18
    RangeLab due
    ThesaurusLab out
    Shortest Weighted Paths I · Chapter 12
    Mar 20
    Review (TBA)
  11. Week 11

    Mar 23
    Shortest Weighted Paths II · Chapter 12 (continued)
    Mar 24
    recitation TBA
    Mar 25
    ThesaurusLab due
    AbridgedLab out
    Graph Contraction I · Chapter 13
    Mar 27
    Review (TBA)
  12. Week 12

    Mar 30
    Graph Contraction II · Chapter 13 (continued)
    Mar 31
    recitation TBA
    Apr 1
    Minimum Spanning Trees · Chapter 14
    Apr 3
    AbridgedLab due
    Exam II Review
  13. Week 13

    Apr 6
    Exam II
    Apr 7
    recitation TBA
    Apr 8
    SegmentLab out
    Dynamic Programming I · Chapter 17
    Apr 10
    Review (TBA)
  14. Week 14

    Apr 13
    Dynamic Programming II · Chapter 17 (Continued)
    Apr 14
    recitation TBA
    Apr 15
    SegmentLab due
    DPLab out
    Hash Tables · Chapter 18
    Apr 17
    Carnival - No Review
  15. Week 15

    Apr 20
    Other Parallel Languages I · Slides
    Apr 21
    recitation TBA
    Apr 22
    CilkLab out
    Other Parallel Languages II
    Apr 24
    Review (TBA)
  16. Week 16

    Apr 27
    DPLab due
    Other Parallel Languages III
    Apr 28
    recitation TBA
    Apr 29
    Priority Queues and Leftist Heaps · Lecture Notes
    May 1
    CilkLab due
    Final Review