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.
本課程是 Accelerated Computer Science Fundamentals 專項課程 專項課程的一部分
提供方
課程信息
提供方
伊利诺伊大学香槟分校
The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.
授課大綱 - 您將從這門課程中學到什麼
Orientation; Hashing
Disjoint Sets
Graph Data Structures
Graph Algorithms
審閱
- 5 stars79.36%
- 4 stars14.68%
- 3 stars4.46%
- 2 stars0.63%
- 1 star0.85%
來自UNORDERED DATA STRUCTURES的熱門評論
This course is very challenging yet covers some very important concepts in CS. Challenge yourself with it!
It was a quick yet detailed intro to unordered data structures. A bit more advanced or difficult but very interesting. Enjoyed a lot.
#inlcude<iostream>
int main(){
std::cout<<"The Best C++ Courses in Data Structures Out There"<<std::endl;
return 0;
}
Overall very good course. It is VERY time consuming if don't have background in CS. Each programming projects can easily take 35-40 hours to complete.
關於 Accelerated Computer Science Fundamentals 專項課程
Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths.
常見問題
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
有助学金吗？
還有其他問題嗎？請訪問 學生幫助中心。
