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
At the end of this project, you will have all the basic skills to create Instagram content to educate and inform your audience using the Canva platform, an online tool for creating and editing... more
\"Inclusive Communication and Behavior in the Workplace\" is an thought-provoking, short-form course designed for beginners interested in developing their inclusive practices. Comprising two... more
This is the 3rd and final course of the spacecraft relative motion course sequence. This course presents a capstone design challenge where you get to develop, simulate and study how to approach a... more
Dive into the world of Primavera P6 PPM with this comprehensive course designed to help you master the essential skills of setting baselines and updating schedules. The course starts by exploring... more
\"Microservices\" describes a software design pattern in which an application is a collection of loosely coupled services. These services are fine-grained, and can be individually maintained and... more
Powered by
