CS302 -- Lecture Notes

James S. Plank

In the first part of the class, we review the basics of C++ plus the standard template library. For reference material, please see the relevant lecture notes for CS140, which are in http://web.eecs.utk.edu/~jplank/plank/classes/cs140/lecture_notes.html.

The lecture notes are maintained on bitbucket. To clone the repo, do:

UNIX> git clone https://jimplank@bitbucket.org/jimplank/cs302_lecture_notes.git

• C-Style strings, sprintf() and sscanf().
• Binary Search.
• Some STL Review: Some Topcoder problems for review.
• Using upper_bound and lower_bound in maps. Evaluating the "Lucky Loser" Keno bet.
• Bit Arithmetic
• Recursion review, including the Sudoku solver.
• Enumeration.
• Interfaces and Inheritance.
• Disjoint Sets.
• JSON.
• A tour de force of sorting algorithms.
• Graph Intro, graph representations, depth first search.
• Breadth-First Search, Shortest Paths and Dijkstra's Algorithm.
• Network Flow.
• Dynamic Programming.
• Minimum Spanning Tree.
• Topological Sort.
• The Halting Problem
• NP Completeness

Lecture Notes That You'll Read in Lab

• GDB

Old Lecture Notes

Old lecture notes that will get updated as they need to:
• I/O in C++, plus compilation and make.
• File I/O, Strings and Vectors.
• Vectors/Classes: The Program to Learn Y'all's Names.
• Using a C++ class to implement methods with protected data.
• Lists, Iterators, Bad Vector Usage, Deques.
• Sets and Maps from the STL.
• Data Structures That Point To Each Other & Traversal.
• Using Maps as Associative Arrays.
• Simulation: Day 1.
• Simulation: Day 2 and into Day 3.
• Breadth-First Search: The Missionaries/Cannibals Problem.
• Generating random numbers according to probability distributions (including extra material on Weibulls).
• Network Flow #1: The basics of network flow.
• Network Flow #2: Programming the augmenting paths.
• Network Flow #3: Evaluating different augmenting path algorithms.
• Really old Old Network Flow #2 (and 3 -- this bundles both into one).