Description
This course is designed for experienced C programmers who want to learn C++. The examples and exercises necessitate a fundamental understanding of algorithms and object-oriented programming.
Syllabus :
1. Module 1
- Overview and Course Organization
- Getting Started
- Converting a C Program to C++
- Using C++ Code
- C++ Improvements
- C++ Advantages
- C++ is Better Than C
- C Swap Function
- Swap Function in C++
- Generics
2. Module 2
- C++ Generics and Functions
- Multiple Template Arguments
- Graph Theory & Algorithms
- Graph as a Data Structure
- Dijkstra Shortest Path
- C++ Creating Types
- Enum & Operator Overloading
- Example: typedef days
- Natural Way to Build Widgets
- C++ Point
3. Module 3
- C++ Classes & Object Orientation
- Point and its Constructor
- More Constructors
- Using Dijkstra's Algorithm
- The is-connected Algorithm
- Complex Aggregates - Lists
- List1
- Print() Chaining
- More Elaborate List
- Deep vs. Shallow Copy
- Destructor
- Dynamic Data Structures in STL
4. Module 4
- MST
- Jarnik-Prim MST
- Jarnik-Prim MST: Another Look
- Kruskal's Algorithm
- Overloading and Function Selection
- STL and STL C++11
- STL Example
- C++11 Feature: auto
- Vector Methods
- More Code
- C++11 Feature: for statement
- STL Input File
- Iterators Categories
- Output a Random Graph
5. Final Exam
- Practice and final.