关于此课程： 本课程是面向有C语言经验的，并想要学习C++编程的程序员们。涉及到的例子和练习需要有对基础算法和面向对象软件的理解。
制作方： University of California, Santa Cruz
教学方： Ira Pohl, Professor
Computer Science
| 语言 | English |
| 如何通过 | 通过所有计分作业以完成课程。 |
| 用户评分 |
授课大纲
第 1 周
Module 1
How to convert an existing C program to C++. Use of type safe Input/Output.
Avoiding the preprocessor.
10 个视频, 1 个阅读材料
- Reading: 1.0 Module 1 Overview
- 视频: 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
已评分: Homework 1: Convert a C program to C++
第 2 周
Module 2
Review of Dijkstra's shortest path algorithm. C++ Functions and Generics. C++ classes and OO.
Point as an example.
10 个视频, 1 个阅读材料
- Reading: 2.0 Module 2 Overview
- 视频: 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
第 3 周
Module 3
Point: Default constructor and initializing syntax. Conversion Constructors. Copy Constructor. List and dynamic memory allocation. Deep Copy.
12 个视频, 1 个阅读材料
- Reading: 3.0 Module 3 Overview
- 视频: 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
已评分: Homework 2: Implement Dijkstra's Algorithm
第 4 周
Module 4
Prim’s and Kruskal’s algorithms. Use of basic Container Classes. Tripod-Container, Iterator, Algorithm.
14 个视频, 1 个阅读材料
- Reading: 4.0 Module 4 Overview
- 视频: 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
已评分: Homework 3: Compute the minimum spanning tree for an inputted graph
第 5 周
Final Exam
Practice and final.
1 个练习测验
- Practice Quiz: Exam Practice 1
已评分: Final Exam
常见问题解答
运作方式
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.
价格
| 购买课程 | |
|---|---|
| 访问课程材料 | 可用 |
| 访问评分的材料 | 可用 |
| 收到最终成绩 | 可用 |
| 获得可共享的课程证书 | 可用 |
评分和审阅
good and nice for programmers
Good For Begginers
good
It is really a very good course and it will take us into real transition from c language to c++