课程信息
19,432 次近期查看

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

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

完成时间大约为16 小时

建议:8 hours/week...

英语(English)

字幕:英语(English)

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.9
13 条评论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

常见问题

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

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

还有其他问题吗?请访问 学生帮助中心