CSCI 256

Algorithms

Home | Schedule | Resources | Williams CS | Glow

Course Schedule

The table below lists the topics we will discuss each meeting and the materials associated with each topic.

Some of these resources will only be accessible from within the campus network. Information about the proxy server can be found here.

The schedule is subject to change: we may wish to explore new topics in response to current events or student interest, or we may wish to revise the pace throughout the semester. If changes are made, they will be made well in advance, and any schedule updates will be noted on GLOW.

Book references:

Date Topic Reading(s) Materials
Fr: 09/09 Introduction & Course Overview
  • KT Ch. 1
Mo: 09/12 Choosing the Right Data Structures, Stable Matching Asymptotics
  • KT Ch. 1
We: 09/14 Upper, Lower, and Tight bounds
  • KT Ch. 2
Fr: 09/16 Largest Sum Subinterval
  • KT Ch. 2
Mo: 09/19 Graphs & Graph Proofs
  • KT § 3.1
We: 09/21 Searching Graphs: BFS & DFS
  • KT § 3.1-3.6
Fr: 09/23 Breadth-first Search Applications
  • KT § 3.1-3.4
Mo: 09/26 Directed Graphs
  • KT § 3.4-3.6
We: 09/28 Greedy: Exchange Method
  • KT § 4-4.3
Fr: 09/30 Greedy: Shortest Paths
  • KT § 4.4
Mo: 10/03 Greedy: Minimum Spanning Trees
  • KT § 4.5
We: 10/05 Greedy: MSTs & Union Find
  • KT § 4.6
Fr: 10/07 Divide & Conquer: Sorting and Recurrences
  • KT § 5-5.2
Mo: 10/10 Reading Period
  • Catch Up
  • Ask Questions
We: 10/12 Recursion-Tree Method
  • KT § 5-5.2
Fr: 10/14 Mountain Day?
  • Eat Donuts
  • Be Outside
Mo: 10/17 Recurrences & Analysis
We: 10/19 Dynamic Programming I
  • KT § 6.1
Fr: 10/21 Dynamic Programming II
  • KT § 6.2
Mo: 10/24 Dynamic Programming III
  • KT § 6.4-6.6
We: 10/26 Dynamic Programming IV
  • KT § 6.9-6.10
Fr: 10/28 Floyd-Warshall
Mo: 10/31 Class Canceled for Take-home Midterm
We: 11/02 Introduction to Flow Networks
  • KT Ch 7.1
Fr: 11/04 Ford-Fulkerson Algorithm
  • KT § 7.2-7.3
Mo: 11/07 Flow Applications
  • KT § 7.5-7.6
We: 11/09 Baseball Elimination
Fr: 11/11 P vs. NP & NP-hardness
  • KT § 8.1, 8.3
Mo: 11/14 Problem Reductions
  • KT § 8.1, 8.3
We: 11/16 NP-hard Reductions
  • KT § 8.2-8.4
Fr: 11/18 Probability Review I
Mo: 11/21 Probability Review II
We: 11/23 Thanksgiving Break
  • Thanksgiving Break
  • Thanksgiving Break
Fr: 11/25 Thanksgiving Break
  • Thanksgiving Break
  • Thanksgiving Break
Mo: 11/28 Randomized QuickSort
  • KT § 13.3, 13.5
We: 11/30 Skip Lists
Fr: 12/02 Skip List Analysis
Mo: 12/05 Hashing
  • KT § 13.6
We: 12/07 Fun with Hashing
Fr: 12/09 B-trees & External Memory
TBD Self-schedule final exam
  • Optional Review