I Understand
We use cookies.Click here for details.

Unordered Data Structures

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.

Created by University of Illinois at Urbana-Champaign


What you’ll learn

Through this educational opportunity you will gain confidence with the skills required from employers today. The most relevant technique in the educational resource that is commonly mentioned by organizations is Data Visualization.

Who will benefit?

Mapping the description from this educational resource with nearly 10,000 data-related job postings, we find that those interested in Data Scientist roles have the most to gain.