The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node. These graph algorithms will also depend on another concept called disjoint sets, so this course will also cover its data structure and associated algorithms.
本课程是 Accelerated Computer Science Fundamentals 专项课程 专项课程的一部分
提供方
课程信息
提供方
伊利诺伊大学香槟分校
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.
授课大纲 - 您将从这门课程中学到什么
Orientation; Hashing
Disjoint Sets
Graph Data Structures
Graph Algorithms
审阅
- 5 stars79.69%
- 4 stars14.47%
- 3 stars4.31%
- 2 stars0.64%
- 1 star0.86%
来自UNORDERED DATA STRUCTURES的热门评论
It was a quick yet detailed intro to unordered data structures. A bit more advanced or difficult but very interesting. Enjoyed a lot.
This course had good coverage on hashing, disjoint sets, graphs. This course will improve coding skills. I'm happy with material, coding practices, quiz and projects.
Excellent Course really helpful and exercises enjoyable exercises!!! Very good teacher!\n\n5 star\n\n(You need to know C++ in advance).
An insanely good course in which the instructors and professors put in the maximum possible amount of work for the student's benefit and clarity. Learnt a ton!
关于 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.
常见问题
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
有助学金吗？
还有其他问题吗？请访问 学生帮助中心。
