Unordered Data Structures

University of Illinois at Urbana-Champaign

software-development   |   Advanced   |   14 Hours

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.

What skills will you gain?

graph traversal

tree traversal

spanning tree

c++

Algorithms

shortest path problem

Data Structures

graph algorithms

graphs

hashing