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.57%
- 4 stars12.64%
- 3 stars2.47%
- 2 stars0.78%
- 1 star0.52%
來自ORDERED DATA STRUCTURES的熱門評論
Great course. Although I believe that programming projects are too difficult to handle for someone without CS background.
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
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
Good quick introduction to ordered data structures. I think this course be well served with a bit more theory explaining the big O justifications.
關於 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.