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.
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.65%
- 4 stars12.61%
- 3 stars2.44%
- 2 stars0.77%
- 1 star0.51%
来自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.
Really good course so far. Using VSC + git bash on a Windows 10 machine for the programming assignments, and the web-based compiler for the challenges. Really good experiences so far.
Good quick introduction to ordered data structures. I think this course be well served with a bit more theory explaining the big O justifications.
My favorite Coursera specialization! Responsive staff, lectures are very clear, assignments are both challenging and educational (closely related to lecture materials). Thank you!
关于 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.