關於此課程：本课程是面向有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 個閱讀材料
- Материал для самостоятельного изучения: 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 個閱讀材料
- Материал для самостоятельного изучения: 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 個閱讀材料
- Материал для самостоятельного изучения: 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 個閱讀材料
- Материал для самостоятельного изучения: 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 個練習測驗
- Тренировочный тест: Exam Practice 1
已評分: Final Exam
常見問題解答
運作方式
Задания курса
Каждый курс — это интерактивный учебник, который содержит видеоматериалы, тесты и проекты.
Помощь сокурсников
Общайтесь с тысячами других учащихся: обсуждайте идеи, материалы курса и помогайте друг другу осваивать новые понятия.
Сертификаты
Получите документы о прохождении курсов и поделитесь своим успехом с друзьями, коллегами и работодателями.
製作方
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
good
I really loved this course. It is really helpul for my programming aspect. I have managed to develop my logical abilty and this course really helped me.
AS
Good For Begginers