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.
Über diesen Kurs
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,61 %
- 4 stars14,37 %
- 3 stars4,50 %
- 2 stars0,64 %
- 1 star0,85 %
Top-Bewertungen von UNORDERED DATA STRUCTURES
Excellent Course really helpful and exercises enjoyable exercises!!! Very good teacher!\n\n5 star\n\n(You need to know C++ in advance).
This course is very challenging yet covers some very important concepts in CS. Challenge yourself with it!
excelente curso! muy buena explicacion de estructuras de datos. Todo el contenido fue explicado de manera muy interesante!
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.
Über den Spezialisierung Accelerated Computer Science Fundamentals
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.
Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.