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 teaches students how to generate univariate graphics, such as histograms and box plots, using generative AI tools to automate and streamline the analysis process. Students will explore... more
Introduction to Cyber Security was designed to help learners develop a deeper understanding of modern information and system protection technology and methods. The learning outcome is simple: We... more
This Specialization will introduce non-native speakers of English to methods for developing English language and communication skills for the workplace, doing business, cross-cultural... more
In this specialization you will learn how to create societal impact through Social Entrepreneurship. Social Entrepreneurship describes the discovery and sustainable exploitation of opportunities to... more
The Workday in Action Series is geared towards learners interested in an in-depth view of the business processes and tasks used by business users across the Workday platform to organize and... more

CONTINUE SEARCH

FOLLOW COLLEGE PARENT CENTRAL