About this Course

194,927 recent views

Learner Career Outcomes

17%

started a new career after completing these courses

12%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Approx. 13 hours to complete
English

Skills you will gain

Graph TheoryC++11C++Graph Algorithms

Learner Career Outcomes

17%

started a new career after completing these courses

12%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Approx. 13 hours to complete
English

Instructor

Offered by

Placeholder

University of California, Santa Cruz

Syllabus - What you will learn from this course

Content RatingThumbs Up93%(8,152 ratings)Info
Week
1

Week 1

3 hours to complete

Module 1

3 hours to complete
10 videos (Total 121 min), 1 reading, 1 quiz
10 videos
1.2 Getting Started5m
1.3 Converting a C Program to C++7m
1.4 Using C++ Code7m
1.5 C++ Improvements6m
1.6 C++ Advantages12m
1.7 C++ is Better Than C16m
1.8 C Swap Function10m
1.9 Swap Function in C++15m
1.10 Generics20m
1 reading
1.0 Module 1 Overview10m
Week
2

Week 2

2 hours to complete

Module 2

2 hours to complete
10 videos (Total 122 min), 1 reading
10 videos
2.2 Multiple Template Arguments8m
2.3 Graph Theory & Algorithms9m
2.4 Graph as a Data Structure11m
2.5 Dijkstra Shortest Path16m
2.6 C++ Creating Types5m
2.7 Enum & Operator Overloading4m
2.8 Example: typedef days18m
2.9 Natural Way to Build Widgets6m
2.10 C++ Point26m
1 reading
2.0 Module 2 Overview10m
Week
3

Week 3

3 hours to complete

Module 3

3 hours to complete
12 videos (Total 116 min), 1 reading, 1 quiz
12 videos
3.2 Point and its Constructor12m
3.3 More Constructors18m
3.4 Using Dijkstra's Algorithm14m
3.5 The is-connected Algorithm12m
3.6 Complex Aggregates - Lists6m
3.7 List12m
3.8 Print() Chaining6m
3.9 More Elaborate List3m
3.10 Deep vs. Shallow Copy8m
3.11 Destructor4m
3.12 Dynamic Data Structures in STL7m
1 reading
3.0 Module 3 Overview10m
Week
4

Week 4

4 hours to complete

Module 4

4 hours to complete
14 videos (Total 164 min), 1 reading, 1 quiz
14 videos
4.2 Jarnik-Prim MST11m
4.3 Jarnik-Prim MST: Another Look11m
4.4 Kruskal's Algorithm8m
4.5 Overloading and Function Selection32m
4.6 STL and STL C++1111m
4.7 STL Example5m
4.8 C++11 Feature: auto5m
4.9 Vector Methods10m
4.10 More Code8m
4.11 C++11 Feature: for statement7m
4.12 STL Input File11m
4.13 Iterators Categories14m
4.14 Output a Random Graph12m
1 reading
4.0 Module 4 Overview10m

Reviews

TOP REVIEWS FROM C++ FOR C PROGRAMMERS, PART A

View all reviews

About the Coding for Everyone: C and C++ Specialization

Coding for Everyone: C and C++

Frequently Asked Questions

More questions? Visit the Learner Help Center.