UCSC - C++ For C Programmers, Part A 

1.1 Overview and Course Organization

1.2 Getting Started

1.3 Converting a C Program to C++

1.4 Using C++ Code

1.5 C++ Improvements

1.6 C++ Advantages

1.7 C++ is Better Than C

1.8 C Swap Function

1.9 Swap Function in C++

1.10 Generics

1.0 Module 1 Overview

2.1 C++ Generics and Functions

2.2 Multiple Template Arguments

2.3 Graph Theory & Algorithms

2.4 Graph as a Data Structure

2.5 Dijkstra Shortest Path

2.6 C++ Creating Types

2.7 Enum & Operator Overloading

2.8 Example: typedef days

2.9 Natural Way to Build Widgets

2.10 C++ Point

2.0 Module 2 Overview

3.1 C++ Classes & Object Orientation

3.2 Point and its Constructor

3.3 More Constructors

3.4 Using Dijkstra's Algorithm

3.5 The is-connected Algorithm

3.6 Complex Aggregates - Lists

3.7 List

3.8 Print() Chaining

3.9 More Elaborate List

3.10 Deep vs. Shallow Copy

3.11 Destructor

3.12 Dynamic Data Structures in STL

3.0 Module 3 Overview

4.1 MST

4.2 Jarnik-Prim MST

4.3 Jarnik-Prim MST: Another Look

4.4 Kruskal's Algorithm

4.5 Overloading and Function Selection

4.6 STL and STL C++11

4.7 STL Example

4.8 C++11 Feature: auto

4.9 Vector Methods

4.10 More Code

4.11 C++11 Feature: for statement

4.12 STL Input File

4.13 Iterators Categories

4.14 Output a Random Graph

4.0 Module 4 Overview

Exam Practice 1

Final Exam