ICS 311 Fall 2017 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. Problem Set links will not work until the assigments are released.

Week 1: Introduction and Basic Concepts

Week 2: Continuing Basic Concepts

Week 3: Analysis of Basic Data Structures

Week 4: Probabilistic Analysis, Randomization, and Hash Tables

Week 5: Divide and Conquer and Binary Search Trees

Week 6: Advanced Sorts and Queues (Heaps, Priority Queues, Heapsort, Quicksort)

Week 7: O(n) Sorts and Midterm

Week 8: Balanced Trees; Midterm Results Review


Week 9: Problem Solving with Dynamic Programming and Greedy Algorithms

Week 10: Graph Representations and Basic Algorithms

Week 11: Amortized Analysis, Union-Find, and Minimum Spanning Trees

Week 12: Finding Shortest Paths in Graphs

Week 13: Maximum Flow in Graphs; Midterm

Week 14: Multithreading and Midterm Results Review

Week 15: NP-Completeness and Approximation Algorithms

Week 16: Special Topic and Wrapup

Finals Week:


Last modified: Fri Oct 13 03:11:31 HST 2017