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 |
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
- 阅读: 1.0 Module 1 Overview
- Video: 1.1 Overview and Course Organization
- Video: 1.2 Getting Started
- Video: 1.3 Converting a C Program to C++
- Video: 1.4 Using C++ Code
- Video: 1.5 C++ Improvements
- Video: 1.6 C++ Advantages
- Video: 1.7 C++ is Better Than C
- Video: 1.8 C Swap Function
- Video: 1.9 Swap Function in C++
- 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
- 阅读: 2.0 Module 2 Overview
- Video: 2.1 C++ Generics and Functions
- Video: 2.2 Multiple Template Arguments
- Video: 2.3 Graph Theory & Algorithms
- Video: 2.4 Graph as a Data Structure
- Video: 2.5 Dijkstra Shortest Path
- Video: 2.6 C++ Creating Types
- Video: 2.7 Enum & Operator Overloading
- Video: 2.8 Example: typedef days
- Video: 2.9 Natural Way to Build Widgets
- 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
- 阅读: 3.0 Module 3 Overview
- Video: 3.1 C++ Classes & Object Orientation
- Video: 3.2 Point and its Constructor
- Video: 3.3 More Constructors
- Video: 3.4 Using Dijkstra's Algorithm
- Video: 3.5 The is-connected Algorithm
- Video: 3.6 Complex Aggregates - Lists
- Video: 3.7 List
- Video: 3.8 Print() Chaining
- Video: 3.9 More Elaborate List
- Video: 3.10 Deep vs. Shallow Copy
- Video: 3.11 Destructor
- 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
- 阅读: 4.0 Module 4 Overview
- Video: 4.1 MST
- Video: 4.2 Jarnik-Prim MST
- Video: 4.3 Jarnik-Prim MST: Another Look
- Video: 4.4 Kruskal's Algorithm
- Video: 4.5 Overloading and Function Selection
- Video: 4.6 STL and STL C++11
- Video: 4.7 STL Example
- Video: 4.8 C++11 Feature: auto
- Video: 4.9 Vector Methods
- Video: 4.10 More Code
- Video: 4.11 C++11 Feature: for statement
- Video: 4.12 STL Input File
- Video: 4.13 Iterators Categories
- 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
- 练习测验: Exam Practice 1
Graded: Final Exam
FAQs
How It Works
课程作业
每门课程都像是一本互动的教科书，具有预先录制的视频、测验和项目。
来自同学的帮助
与其他成千上万的学生相联系，对想法进行辩论，讨论课程材料，并寻求帮助来掌握概念。
证书
获得正式认证的作业，并与朋友、同事和雇主分享您的成功。
Creators
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.
Pricing
| Purchase Course | |
|---|---|
| Access to course materials | Available |
| Access to graded materials | Available |
| Receive a final grade | Available |
| Earn a shareable Course Certificate | Available |
Ratings and Reviews
really great assignments.... it is more than just theoretical knowledge
its a amazing
very good explanation ..
Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.
© 2018 Coursera Inc. All rights reserved.
Very useful and practical course, you learn interesting stuff about graphs along the way too!