Unordered Data Structures(으)로 돌아가기
일리노이대학교 어버너-섐페인캠퍼스의 Unordered Data Structures 학습자 리뷰 및 피드백
4.9
31개의 평가
강좌 소개
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.
필터링 기준:
Unordered Data Structures의 1개 리뷰 중 1~1
교육 기관: Amar R
•Jun 02, 2019
Thanks for offering this challenging course!
Coursera는 세계 최고의 교육에 대한 보편적인 접근 기회를 제공하며,
최고의 대학 및 기관들과 제휴하여 온라인 강좌를 제공합니다.
© 2019 Coursera Inc. All rights reserved.
