Chevron Left
Voltar para Unordered Data Structures

Comentários e feedback de alunos de Unordered Data Structures da instituição Universidade de Illinois em Urbana-ChampaignUniversidade de Illinois em Urbana-Champaign

4.7
estrelas
473 classificações

Sobre o curso

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....

Melhores avaliações

YC

6 de mai de 2022

Great Teacher, although there are still a lot that I need to learn on my own(I come from non-CS background), after hereing these lectures, I feel that I have already learnt a ton.

AF

16 de jul de 2020

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.

Filtrar por:

101 — 101 de 101 Avaliações para o Unordered Data Structures

por James K

3 de ago de 2021