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.
Этот курс входит в специализацию ''Специализация Accelerated Computer Science Fundamentals'
от партнера


Об этом курсе
от партнера

Иллинойсский университет в Урбане-Шампейне
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.
Программа курса: что вы изучите
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
Рецензии
- 5 stars83,79 %
- 4 stars12,64 %
- 3 stars2,37 %
- 2 stars0,79 %
- 1 star0,39 %
Лучшие отзывы о курсе ORDERED DATA STRUCTURES
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.
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
Very good course, the professor can taught key concept of basic data structure in these short videos very well. Those exercises are also very helpful.
This is one of the best courses I have studied so far, the instructor's way is very easy to understand yet provides in-depth understanding of the material.
Специализация 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.

Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.