關於此課程：The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
此課程適用人群：Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
製作方： Stanford University
教學方： Tim Roughgarden, Professor
Computer Science
| 基本信息 | 課程 2（共 4 門，Algorithms Specialization ） |
| 級別 | 中級 |
| 承諾學習時間 | 4 weeks of study, 4-8 hours/week |
| 語言 | English |
| 如何通過 | 通過所有計分作業以完成課程。 |
| 用戶評分 |
授課大綱
第 1 週
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 個視頻, 4 個閱讀材料
- Материал для самостоятельного изучения: Week 1 Overview
- Материал для самостоятельного изучения: Overview, Resources, and Policies
- Материал для самостоятельного изучения: Lecture slides
- 視頻: Breadth-First Search (BFS): The Basics
- 視頻: BFS and Shortest Paths
- 視頻: BFS and Undirected Connectivity
- 視頻: Depth-First Search (DFS): The Basics
- 視頻: Topological Sort
- 視頻: Computing Strong Components: The Algorithm
- 視頻: Computing Strong Components: The Analysis
- 視頻: Structure of the Web [Optional]
- Материал для самостоятельного изучения: Optional Theory Problems (Week 1)
已評分: Problem Set #1
已評分: Programming Assignment #1
第 2 週
Week 2
Dijkstra's shortest-path algorithm.
4 個視頻, 2 個閱讀材料
- Материал для самостоятельного изучения: Week 2 Overview
- 視頻: Dijkstra's Algorithm: Examples
- 視頻: Correctness of Dijkstra's Algorithm
- 視頻: Dijkstra's Algorithm: Implementation and Running Time
- Материал для самостоятельного изучения: Optional Theory Problems (Week 2)
已評分: Problem Set #2
已評分: Programming Assignment #2
第 3 週
Week 3
Heaps; balanced binary search trees.
9 個視頻, 1 個閱讀材料
- Материал для самостоятельного изучения: Week 3 Overview
- 視頻: Heaps: Operations and Applications
- 視頻: Heaps: Implementation Details [Advanced - Optional]
- 視頻: Balanced Search Trees: Operations and Applications
- 視頻: Binary Search Tree Basics, Part I
- 視頻: Binary Search Tree Basics, Part II
- 視頻: Red-Black Trees
- 視頻: Rotations [Advanced - Optional]
- 視頻: Insertion in a Red-Black Tree [Advanced]
已評分: Problem Set #3
已評分: Programming Assignment #3
第 4 週
Week 4
Hashing; bloom filters.
9 個視頻, 3 個閱讀材料
- Материал для самостоятельного изучения: Week 4 Overview
- 視頻: Hash Tables: Implementation Details, Part I
- 視頻: Hash Tables: Implementation Details, Part II
- 視頻: Pathological Data Sets and Universal Hashing Motivation
- 視頻: Universal Hashing: Definition and Example [Advanced - Optional]
- 視頻: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- 視頻: Hash Table Performance with Open Addressing [Advanced - Optional]
- 視頻: Bloom Filters: The Basics
- 視頻: Bloom Filters: Heuristic Analysis
- Материал для самостоятельного изучения: Optional Theory Problems (Week 4)
- Материал для самостоятельного изучения: Info and FAQ for final exam
已評分: Problem Set #4
已評分: Programming Assignment #4
已評分: Final Exam
常見問題解答
運作方式
Задания курса
Каждый курс — это интерактивный учебник, который содержит видеоматериалы, тесты и проекты.
Помощь сокурсников
Общайтесь с тысячами других учащихся: обсуждайте идеи, материалы курса и помогайте друг другу осваивать новые понятия.
Сертификаты
Получите документы о прохождении курсов и поделитесь своим успехом с друзьями, коллегами и работодателями.
製作方
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
價格
| 購買課程 | |
|---|---|
| 訪問課程材料 | 可用 |
| 訪問評分的材料 | 可用 |
| 收到最終成績 | 可用 |
| 獲得可共享的課程證書 | 可用 |
評分和審閱
Very nice introduction to Graph Search. Thanks to the instructors!
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!
clearly instruction to learn algorithm and well-designed assignment to practice