Unordered Data Structures
About this 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.
83/100
CourseAsk score
- What the provider tells you
- 32/45
- Who stands behind it
- 35/35
- How complete the listing is
- 16/20
Scores how much the provider publishes and who stands behind it — not how well it is taught.
What you'll learn
- Understanding of hash tables and their implementation
- Knowledge of disjoint sets and associated algorithms
- Ability to utilize graphs for representing relationships
- Skills in graph traversal algorithms and finding shortest paths
Price shown by Coursera — confirm on their site.
Enroll on CourseraYou'll be redirected to Coursera to complete enrollment.
- Listed & compared by CourseAsk
- English · 0
Udemy
Coursera
Compared on these lists
Where this course ranks against the alternatives.