Chad Waters, cgwater@clemson.edu

Office Hours: McAdams Hall, Rm 216, TR 1p - 3p

Meeting: Poole E146, MWF 11:15a - 12:05p

Labs

Lecture Materials

• Syllabus
• Thinking in C++, 2nd ed, Vol 1
• #1 - Introduction, Motivation, Fundamental Concepts
  • Wikipedia -- Big-O notation
  • CS Animated -- Big-O notation
  • Lecture Video (Brian Dean)
• #2 - Abstract Data Types, Stacks and Queues, Sets/Dictionaries, Skip Lists
  • Lecture Video (Brian Dean)
• #3 - Hash Tables
• #4 - Hashing Applications I
• #5 - Hashing Applications II
• #6 - Hashing Applications III
• #7 - Recursion, Divide and Conquer, Sorting
• #8 - Divide and Conquer, Recurrences
• #9 - Binary Search Trees
• #10 - Balanced Binary Search Trees
• #11 - Range Queries, Quadtrees, k-d Trees
• #12 - Priority Queues, Heaps
• #13 - String Matching, Tries
• #14 - Sweeplines (Brian Dean)
• #15 - Smart Exhaustive Search, NP-hard Problems
  • Graph of NP-complete problems and their reductions
  • Wikipedia -- List of NP-complete problems
• #16 - Iterative Refinement, Biologically-Inspired Algorithms
  • Wikipedia -- Neural Networks
  • Wikipedia -- Genetic Algorithms
  • Boxcar2d
• #17 - Approximation Algorithms
• #18 - Graph Algorithms, Connectivity Problems
• #19 - Graph Algorithms, Shortest Paths, Dijkstra's Algorithm
  • Dijkstra's Algorithm Animated

Tests

• Midterm (with solutions)

Assignments

• Assignment 1 - Collisions
  • hash.cpp, hash.h, main.cpp
• Assignment 2 (Due Wed, Nov 13 @ 11:15am EDT)
  • Solutions
• Assignment 3 (Due Wed, Dec 11 @ 11:59pm EST)