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.
이 강좌는 Accelerated Computer Science Fundamentals 특화 과정의 일부입니다.
제공자:


이 강좌에 대하여
제공자:

일리노이대학교 어버너-섐페인캠퍼스
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.
강의 계획표 - 이 강좌에서 배울 내용
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
검토
- 5 stars83.79%
- 4 stars12.61%
- 3 stars2.39%
- 2 stars0.79%
- 1 star0.39%
ORDERED DATA STRUCTURES의 최상위 리뷰
It covers a lot of material in a short span of time, so retention is key. Make sure to take a lot of notes and give yourself some time to really process all the material from each week.
Well-taught course! I love the instructor's enthusiasm and great explanations. The exercises are diverse and really help you reinforce your understanding.
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
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.
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.

자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.