In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
Este curso forma parte de Programa especializado: Accelerated Computer Science Fundamentals
ofrecido por


Acerca de este Curso
ofrecido por

Universidad de Illinois en 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.
Programa - Qué aprenderás en este curso
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
Reseñas
- 5 stars83,79 %
- 4 stars12,64 %
- 3 stars2,37 %
- 2 stars0,79 %
- 1 star0,39 %
Principales reseñas sobre ORDERED DATA STRUCTURES
Really good course, Makes you understand the intuition of the data structures pretty clear. The exams and assignment for week 4 seems a bit rushed, Could have been better
The weekly forums were very helpful. Appreciate the effort put in by staff to make the course easily manageable online.
Excellent course, excellent teacher. Just the right approach to teaching data structures, Ive seen a few videos in the topic and this course is very good.
Good quick introduction to ordered data structures. I think this course be well served with a bit more theory explaining the big O justifications.
Acerca de Programa especializado: 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.

Preguntas Frecuentes
¿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 Alumno.