ICS 311 Fall 2015 Schedule


Click here to go to this week.

Classes are in Webster 101. See the index page for categorical listings of all assignments and topics.

Week 1: Introduction and Basic Concepts (Mostly review of ICS 211, 141 and 241)

Week 2: Divide & Conquer, Recurrences and Binary Search Trees

Week 3: Balanced Binary Search Trees

Week 4: Heaps, Priority Queues and Randomized Algorithms

Week 5: Applications of Randomized Algorithms

Week 6: Selection, Sorting Lower Bound, Linear Sorting

Week 7: Review and Midterm

Week 8: Dynamic Programming

Week 9: Greedy Algorithms and Basic Graph Algorithms

Week 10: Topological Sort, SCC, Sets and Union-Find

Week 11: Minimum Spanning Trees, Finding Shortest Paths in Graphs

Week 12: All-Pairs Shortest Paths on Dense Graphs

Week 13: Midterm and Midterm Review

Week 14: Maximum Flow in Graphs

Week 15: NP-Completeness and Approximation Algorithms


Week 16: Multithreading


Finals Week: