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.
Ce cours fait partie de la Spécialisation Accelerated Computer Science Fundamentals
Offert par
Spécialisation Accelerated Computer Science FundamentalsUniversité de l'Illinois à Urbana-ChampaignÀ propos de ce cours
Offert par
Université de l'Illinois à Urbana-Champaign
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.
Programme de cours : ce que vous apprendrez dans ce cours
Orientation; Hashing
Disjoint Sets
Graph Data Structures
Graph Algorithms
Avis
- 5 stars79,65 %
- 4 stars14,34 %
- 3 stars4,49 %
- 2 stars0,64 %
- 1 star0,85 %
Meilleurs avis pour UNORDERED DATA STRUCTURES
I wish the course was more detailed. Some PDFs to explain the concept more. Other than that I am happy with the content.
A lot of new concepts learned. However I would have like to do more programming, exploring more features of C++. Changing only one or two lines of an existing code does not help much in our learning.
Good class. I'm still a little mixed on the approach where the student just supplies a small amount of code in a large (mostly complete) class. Nevertheless, enjoyed.
It was a quick yet detailed intro to unordered data structures. A bit more advanced or difficult but very interesting. Enjoyed a lot.
À propos du Spécialisation 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.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.
