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.52%
- 4 stars12.80%
- 3 stars2.40%
- 2 stars0.76%
- 1 star0.50%
ORDERED 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.
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.
My favorite Coursera specialization! Responsive staff, lectures are very clear, assignments are both challenging and educational (closely related to lecture materials). Thank you!
Great course. Although I believe that programming projects are too difficult to handle for someone without CS background.
Accelerated Computer Science Fundamentals 특화 과정 정보
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.