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
University of Illinois at Urbana-Champaign
The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.
- 5 stars79.24%
- 4 stars14.88%
- 3 stars4.40%
- 2 stars0.62%
- 1 star0.83%
TOP REVIEWS FROM UNORDERED DATA STRUCTURES
excelente curso! muy buena explicacion de estructuras de datos. Todo el contenido fue explicado de manera muy interesante!
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.
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.
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.
About the Accelerated Computer Science Fundamentals Specialization
Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths.
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.