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.46%
- 4 stars14.73%
- 3 stars4.35%
- 2 stars0.62%
- 1 star0.82%
來自UNORDERED DATA STRUCTURES的熱門評論
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.
I wish the course was more detailed. Some PDFs to explain the concept more. Other than that I am happy with the content.
Overall, great course. Slightly obscure challenges sometimes, but homeworks were awesome because of how well commented all the provided code was.
Instructor and videos were also amazing!
Very Challenging course. Learned a lot, very clear instruction. Assignments were interesting and challenging.