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.
About this Course
- 5 stars80.31%
- 4 stars13.97%
- 3 stars4.13%
- 2 stars0.59%
- 1 star0.98%
TOP REVIEWS FROM UNORDERED DATA STRUCTURES
std::cout<<"The Best C++ Courses in Data Structures Out There"<<std::endl;
Great course! Very interesting lecture material / content. I can't give this course a five however, as the assignments seem unnecessarily convoluted, and abstracted to demonstrate the material.
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.
This course had good coverage on hashing, disjoint sets, graphs. This course will improve coding skills.
I'm happy with material, coding practices, quiz and projects.
About the Accelerated Computer Science Fundamentals Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.