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.
Acerca de este Curso
- 5 stars79,41 %
- 4 stars14,76 %
- 3 stars4,36 %
- 2 stars0,62 %
- 1 star0,83 %
Principales reseñas sobre UNORDERED DATA STRUCTURES
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.
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.
The final course of this specialization, really useful, and I learned a lot. Just need more practices to understand some difficult concept.
Acerca de Programa especializado: Accelerated Computer Science Fundamentals
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Estudiante.