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.
- 5 stars83.50%
- 4 stars12.81%
- 3 stars2.41%
- 2 stars0.76%
- 1 star0.50%
來自ORDERED DATA STRUCTURES的熱門評論
Nice course, challenging. A little bit dense and fast though. But I learned a lot of things for a person who has no computer science background.
Was a bit fast for me to catch at first, but I eventually got the hang of the pace. Loved the resources the instructor provided. Illinois is lucky to have such a great educator.
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!