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.
À propos de ce cours
- 5 stars79,29 %
- 4 stars14,69 %
- 3 stars4,34 %
- 2 stars0,62 %
- 1 star1,03 %
Meilleurs avis pour UNORDERED DATA STRUCTURES
Very well-explained and worthy course. I have learnt many interesting things I can use in my daily work. Thanks a lot!
Great Teacher, although there are still a lot that I need to learn on my own(I come from non-CS background), after hereing these lectures, I feel that I have already learnt a ton.
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.
An insanely good course in which the instructors and professors put in the maximum possible amount of work for the student's benefit and clarity. Learnt a ton!
À propos du Spécialisation Accelerated Computer Science Fundamentals
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.