Back to Unordered Data Structures
Learner Reviews & Feedback for Unordered Data Structures by University of Illinois Urbana-Champaign
555 ratings
About the Course
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.
Top reviews
YC
May 6, 2022
Great Teacher, although there are still a lot that I need to learn on my own(I come from non-CS background), after hereing these lectures, I feel that I have already learnt a ton.
AF
Jul 16, 2020
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.
Filter by: