課程信息
26,780 次近期查看

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

完成時間大約為16 小時

建議:8 hours/week...

英語(English)

字幕:英語(English)
學習Course的學生是
  • Machine Learning Engineers
  • Data Scientists
  • Software Engineers
  • Research Assistants
  • Researchers

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

完成時間大約為16 小時

建議:8 hours/week...

英語(English)

字幕:英語(English)

教學大綱 - 您將從這門課程中學到什麼

1
完成時間為 7 小時

Orientation; Hashing

7 個視頻 (總計 43 分鐘), 3 個閱讀材料, 4 個測驗
7 個視頻
Lesson 1.1.2 Hashing - Hash Function10分鐘
Lesson 1.1.3 Hashing - Hash Function Examples4分鐘
Lesson 1.1.4 Collision Handling I: Separate Chaining4分鐘
Lesson 1.1.5 Collision Handling II: Probing and Double Hashing12分鐘
Lesson 1.1.6 Hashing Analysis3分鐘
Lesson 1.1.7 Hash Tables in C++2分鐘
3 個閱讀材料
Syllabus10分鐘
Additional References for C++10分鐘
Week 1 Overview10分鐘
3 個練習
Orientation Quiz5分鐘
Week 1 Quiz30分鐘
Week 1 Challenge Problem30分鐘
2
完成時間為 3 小時

Disjoint Sets

6 個視頻 (總計 32 分鐘), 2 個閱讀材料, 2 個測驗
6 個視頻
2.1.2 Disjoint Sets: Naive Implementation4分鐘
2.1.3 Disjoint Sets: UpTrees - A Better Implementation6分鐘
2.1.4 UpTrees: Simple Running Time3分鐘
2.1.5A UpTrees: Smart Union & Path Compression I8分鐘
2.1.5B UpTrees: Smart Union & Path Compression II4分鐘
2 個閱讀材料
Week 2 Overview10分鐘
Terminology Note: "Disjoint Sets" and "Union-Find"1分鐘
2 個練習
Week 2 Quiz1小時
Week 2 Challenge Problem1小時
3
完成時間為 7 小時

Graph Data Structures

5 個視頻 (總計 35 分鐘), 1 個閱讀材料, 3 個測驗
5 個視頻
3.1.2 Graphs: Vocabulary8分鐘
3.1.3 Graphs: Edge List Implementation4分鐘
3.1.4 Graphs: Adjacency Matrix Implementation6分鐘
3.1.5 Graphs: Adjacency List Implementation8分鐘
1 個閱讀材料
Week 3 Overview10分鐘
2 個練習
Week 3 Quiz30分鐘
Week 3 Challenge Problem1小時
4
完成時間為 3 小時

Graph Algorithms

11 個視頻 (總計 75 分鐘), 1 個閱讀材料, 2 個測驗
11 個視頻
4.1.2 Graphs: BFS Analysis9分鐘
4.1.3 Graphs: DFS Traversal8分鐘
4.2.1 Minimum Spanning Trees (MST) Introduction2分鐘
4.2.2 MST: Kruskal's Algorithm I6分鐘
4.2.3 MST: Kruskal's Algorithm II5分鐘
4.2.4 MST: Prim's Algorithm9分鐘
4.3.1 Graphs: Dijkstra's Algorithm6分鐘
4.3.2 Graphs: Dijkstra's Edge Cases8分鐘
4.3.3 Graphs: Dijkstra's Running Time2分鐘
4.3.4 Graphs: Landmark Path Problem7分鐘
1 個閱讀材料
Week 4 Overview10分鐘
2 個練習
Week 4 Quiz30分鐘
Week 4 Challenge Problem1小時
4.8
7 個審閱Chevron Right

來自Unordered Data Structures的熱門評論

創建者 RKSep 16th 2019

Very Challenging course. Learned a lot, very clear instruction. Assignments were interesting and challenging.

創建者 VMAug 30th 2019

Excellent course! Looking forward to a more advanced course from the same course staff!

講師

Avatar

Wade Fagen-Ulmschneider

Teaching Assistant Professor
Computer Science

關於 伊利诺伊大学香槟分校

The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs. ...

關於 Accelerated Computer Science Fundamentals 專項課程

Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths. This Specialization sequence is designed to help prospective applicants to the flexible and affordable Online Master of Computer Science (MCS) and MCS in Data Science prepare for the Online MCS Entrance Exam. The Online MCS Entrance Exam allows applicants who do not have graded and transcripted prerequisite CS coursework in the areas of data structures, algorithms, and object-oriented programming to strengthen their applications for admission. Learn more about the Online MCS Entrance Exam....
Accelerated Computer Science Fundamentals

常見問題

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心