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.41%
- 4 stars14.76%
- 3 stars4.36%
- 2 stars0.62%
- 1 star0.83%
来自UNORDERED DATA STRUCTURES的热门评论
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.
Excellent Course really helpful and exercises enjoyable exercises!!!
Very good teacher!
(You need to know C++ in advance).
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.
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.