CS302 -- Fundamental Algorithms

Topics

1. Intro to Object-Oriented Programming
2. Schildt Ch. 1

1. Introduction to C++
2. C versus C++
3. Schildt Ch 4.4-4.5

1. C++ class syntax
2. Schildt Ch. 2, 4.3

1. C++ streams
2. C++ lists

1. Schildt ch 8.1-8.4, 9.2, 9.6--Streams
2. Schildt ch 14.4--Lists
3. I/O Streams
4. The Standard Template Library
5. SGI's Introduction to the STL Library--This is a general reference for the STD that you might find useful when you have a question about a specific class or want to see if C++ has a class that meets your needs before you write a custom class

1. How to design objects
2. Templates

1. Object-oriented design
2. Weiss Ch 1.6
3. Schildt Ch 11.1-11.2

1. Constructors and Operators
2. Schildt Ch 3.1-3.3, 4.6-4.8, 5.1-5.2, and 6.6
3. Map/Sort examples

1. time complexity
2. Weiss Ch 2

1. priority queues
2. Weiss Ch 6.1-6.4

1. Simulation and Priority Queues
2. Inheritance

1. Inheritance
2. Schildt Ch 2.3, 7.3, 10

1. Weiss Ch. 7
2. Internal Sorting I

1. Weiss Ch 9.1-9.2
2. Graph algorithms--graph searching
3. Graph algorithms--reading graphs, topological sort, cycle detection

1. Graph Searching
2. Shortest Path Algorithms

1. Shortest Paths and Minimum Spanning Trees
2. Weiss Ch 9.3

1. Minimum Spanning Trees
2. Biconnectivity
3. Strong Components

1. Network Flow
2. Weiss Ch 9.4