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.
イリノイ大学アーバナ・シャンペーン校（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.
- 5 stars83.79%
- 4 stars12.64%
- 3 stars2.37%
- 2 stars0.79%
- 1 star0.39%
ORDERED DATA STRUCTURES からの人気レビュー
My favorite Coursera specialization! Responsive staff, lectures are very clear, assignments are both challenging and educational (closely related to lecture materials). Thank you!
The lectures are good and elaborate. Some of the exercises are very confusing though. Overall a good introduction to data structures.
The material covered is explained very well, but it feels like these UIUC courses are light in terms of total material per course.
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
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.