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.
Informações sobre o curso
Universidade de Illinois em Urbana-ChampaignUniversidade de Illinois em 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,36%
- 4 stars14,68%
- 3 stars4,46%
- 2 stars0,63%
- 1 star0,85%
Principais avaliações do UNORDERED DATA STRUCTURES
The final course of this specialization, really useful, and I learned a lot. Just need more practices to understand some difficult concept.
Excellent Course really helpful and exercises enjoyable exercises!!!
Very good teacher!
(You need to know C++ in advance).
std::cout<<"The Best C++ Courses in Data Structures Out There"<<std::endl;
Very Challenging course. Learned a lot, very clear instruction. Assignments were interesting and challenging.
Sobre Programa de cursos integrados 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.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao me inscrever nesta Especialização?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao estudante.