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.
This course is part of the Accelerated Computer Science Fundamentals Specialization
About this Course
Syllabus - What you will learn from this course
Graph Data Structures
- 5 stars80.19%
- 4 stars14.23%
- 3 stars4.03%
- 2 stars0.57%
- 1 star0.96%
TOP REVIEWS FROM UNORDERED DATA STRUCTURES
std::cout<<"The Best C++ Courses in Data Structures Out There"<<std::endl;
The last section on graphs seems hurried, everything right up to BFS seemed structured but it felt like there was a sudden pack up.
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.
The final course of this specialization, really useful, and I learned a lot. Just need more practices to understand some difficult concept.
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.