C++ For C Programmers, Part A

About this course: This course is for experienced C programmers who want to program in C++. The examples and exercises require a basic understanding of algorithms and object-oriented software.

Created by:  University of California, Santa Cruz

• Taught by:  Ira Pohl, Professor

  Computer Science

Language English How To Pass Pass all graded assignments to complete the course. User Ratings 4.3 stars Average User Rating 4.3See what learners said Coursework

Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.

Help from your peers

Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.

Certificates

Earn official recognition for your work, and share your success with friends, colleagues, and employers.

University of California, Santa Cruz UC Santa Cruz is an outstanding public research university with a deep commitment to undergraduate education. It’s a place that connects people and programs in unexpected ways while providing unparalleled opportunities for students to learn through hands-on experience.

Syllabus


WEEK 1


Module 1
How to convert an existing C program to C++. Use of type safe Input/Output. Avoiding the preprocessor.


10 videos, 1 reading expand

1. Reading: 1.0 Module 1 Overview
2. Video: 1.1 Overview and Course Organization
3. Video: 1.2 Getting Started
4. Video: 1.3 Converting a C Program to C++
5. Video: 1.4 Using C++ Code
6. Video: 1.5 C++ Improvements
7. Video: 1.6 C++ Advantages
8. Video: 1.7 C++ is Better Than C
9. Video: 1.8 C Swap Function
10. Video: 1.9 Swap Function in C++
11. Video: 1.10 Generics

Graded: Homework 1: Convert a C program to C++

WEEK 2


Module 2
Review of Dijkstra's shortest path algorithm. C++ Functions and Generics. C++ classes and OO. Point as an example.


10 videos, 1 reading expand

1. Reading: 2.0 Module 2 Overview
2. Video: 2.1 C++ Generics and Functions
3. Video: 2.2 Multiple Template Arguments
4. Video: 2.3 Graph Theory & Algorithms
5. Video: 2.4 Graph as a Data Structure
6. Video: 2.5 Dijkstra Shortest Path
7. Video: 2.6 C++ Creating Types
8. Video: 2.7 Enum & Operator Overloading
9. Video: 2.8 Example: typedef days
10. Video: 2.9 Natural Way to Build Widgets
11. Video: 2.10 C++ Point

WEEK 3


Module 3
Point: Default constructor and initializing syntax. Conversion Constructors. Copy Constructor. List and dynamic memory allocation. Deep Copy.


12 videos, 1 reading expand

1. Reading: 3.0 Module 3 Overview
2. Video: 3.1 C++ Classes & Object Orientation
3. Video: 3.2 Point and its Constructor
4. Video: 3.3 Constructors
5. Video: 3.4 Using Dijkstra's Algorithm
6. Video: 3.5 The is-connected Algorithm
7. Video: 3.6 Complex Aggregates - Lists
8. Video: 3.7 List
9. Video: 3.8 Print() Chaining
10. Video: 3.9 Elaborate List
11. Video: 3.10 Deep vs. Shallow Copy
12. Video: 3.11 Destructor
13. Video: 3.12 Dynamic Data Structures in STL

Graded: Homework 2: Implement Dijkstra's Algorithm

WEEK 4


Module 4
Prim’s and Kruskal’s algorithms. Use of basic Container Classes. Tripod-Container, Iterator, Algorithm.


14 videos, 1 reading expand

1. Reading: 4.0 Module 4 Overview
2. Video: 4.1 MST
3. Video: 4.2 Jarnik-Prim MST
4. Video: 4.3 Jarnik-Prim MST: Another Look
5. Video: 4.4 Kruskal's Algorithm
6. Video: 4.5 Overloading and Function Selection
7. Video: 4.6 STL and STL C++11
8. Video: 4.7 STL Example
9. Video: 4.8 C++11 Feature: auto
10. Video: 4.9 Vector Methods
11. Video: 4.10 Code
12. Video: 4.11 C++11 Feature: for statement
13. Video: 4.12 STL Input File
14. Video: 4.13 Iterators Categories
15. Video: 4.14 Output a Random Graph

Graded: Homework 3: Compute the minimum spanning tree for an inputted graph

WEEK 5


Final Exam
Practice and final.


1 practice quiz expand

1. Practice Quiz: Exam Practice 1

Graded: Final Exam