Unordered Data Structures

开始时间: 04/22/2022 持续时间: 未知

所在平台: Coursera

课程主页: https://www.coursera.org/learn/cs-fundamentals-3

课程评论：没有评论

第一个写评论        关注课程

课程详情

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.

课程大纲

Part: 1

Title:Orientation; Hashing

Description:

Part: 2

Title:Disjoint Sets

Description:

Part: 3

Title:Graph Data Structures

Description:

Part: 4

Title:Graph Algorithms

Description:

课程评论(0条)