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.
- 5 stars79.29%
- 4 stars14.69%
- 3 stars4.34%
- 2 stars0.62%
- 1 star1.03%
來自UNORDERED DATA STRUCTURES的熱門評論
Very Challenging course. Learned a lot, very clear instruction. Assignments were interesting and challenging.
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.
It was a quick yet detailed intro to unordered data structures. A bit more advanced or difficult but very interesting. Enjoyed a lot.
excelente curso! muy buena explicacion de estructuras de datos. Todo el contenido fue explicado de manera muy interesante!