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専門講座に属します。
提供:


このコースについて
提供:

イリノイ大学アーバナ・シャンペーン校(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.
シラバス - 本コースの学習内容
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
レビュー
- 5 stars83.55%
- 4 stars12.66%
- 3 stars2.48%
- 2 stars0.78%
- 1 star0.52%
ORDERED DATA STRUCTURES からの人気レビュー
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
The lectures are good and elaborate. Some of the exercises are very confusing though.
Overall a good introduction to 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
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.

よくある質問
いつ講座や課題にアクセスできるようになりますか?
この専門講座をサブスクライブすると何を行うことができるようになりますか?
学資援助はありますか?
さらに質問がある場合は、受講者ヘルプセンターにアクセスしてください。