CS302 -- Lecture Notes

James S. Plank

First, see http://www.cppreference.com/ or www.cplusplus.com excellent sources of online reference and tutorial material for C++. If you need a book to help you with C++, try "Teach Yourself C++", 3rd Ed., Herbert Schildt. -- 32 cents from Amazon.

Lecture #1: I/O in C++, plus compilation and make.
Lecture #2: File I/O, Strings and Vectors.
Lecture #3: The program that associates names and pictures.
Lecture #4: A Quick Set & Map Example from the STL.
Lecture #5: The binary heap implementation of Priority Queues.
Lecture #6: Generating random numbers according to probability distributions.
Lecture #7: Event-Based simulation.
Lecture #8: A tour de force of sorting algorithms.
Dr. Parker went over graph terminology and topological sort. See the next set of lecture notes for reference material.
Lecture #9: Generating random graphs and depth first search.
Lecture #10: Breadth-First Search: The Missionaries/Cannibals Problem.
Lecture #11: The Minimum Spanning Tree Problem, Prim's Algorithm and Kruskal's Algorithm.
Lecture #12: Disjoint sets.
Lecture #13: Network Flow: Maximum Flows, Minimum Cuts, Residual Graphs, The Edmonds-Karp Algorithm.
Lecture #14: Network Flow: Programming it all up.
Lecture #15: Dynamic Programming.
Lecture #16: The Halting Problem.