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.
Dieser Kurs ist Teil der Spezialisierung Spezialisierung Accelerated Computer Science Fundamentals
von


Über diesen Kurs
von

University of Illinois at 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.
Lehrplan - Was Sie in diesem Kurs lernen werden
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
Bewertungen
- 5 stars83,79 %
- 4 stars12,64 %
- 3 stars2,37 %
- 2 stars0,79 %
- 1 star0,39 %
Top-Bewertungen von ORDERED DATA STRUCTURES
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.
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
The weekly forums were very helpful. Appreciate the effort put in by staff to make the course easily manageable online.
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
Über den Spezialisierung 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.

Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.