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.

Created by: University of Illinois Urbana-Champaign


Related Online Courses

This course prepares you to recognize the complexities and nuances of different renewable energy solutions, as well as relevant career opportunities (both technical occupations and roles not... more
This specialization introduces the Go programming language from Google and provides learners with an overview of Go\'s special features. Upon completing the three-course sequence, learners will... more
Explore the multidimensional world of Human Factors and learn the strategies behind optimizing human interactions and performance. In this specialization, you will dive into the field of human... more
This specialization is designed for post-graduate students aiming to advance their skills in AI, cybersecurity, & industrial control systems (ICS) security. Through three in-depth courses, you will... more
We all love stories, so why don\'t we use more of them at work? In this project we will help you learn some tools of good storytelling and create one for a freely available data set from KIVA, the... more

CONTINUE SEARCH

FOLLOW COLLEGE PARENT CENTRAL