Unordered Data Structures
Offered By: University of Illinois at Urbana-Champaign via Coursera
Course Description
Overview
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.
Syllabus
- Orientation; Hashing
- Disjoint Sets
- Graph Data Structures
- Graph Algorithms
Taught by
Wade Fagen-Ulmschneider
Tags
Related Courses
Algorithms, Part IPrinceton University via Coursera Data Structures
University of California, San Diego via Coursera Data Structures and Algorithm Design Part II | 数据结构与算法设计(下)
Tsinghua University via edX Graph Search, Shortest Paths, and Data Structures
Stanford University via Coursera Data Structures Fundamentals
University of California, San Diego via edX