Home
Explore Uedu
Student Console
Register as Member/Login
Research Informed Consent Center
問卷中心
UeduGPTs
Aida 優學伴
Agentic AI
本地 AI
找指導老師
論文閱讀
Uedu Note
Uedu Open
Uedu Jupyter
語言學習
Lingua Writing
我的寫作歷程
認知組學測驗工具箱
Uedu Finance 優財經
Uedu 跨域通識
Uedu Physics 優物理
Uedu Calculus 優微積分
Uedu Biology 優生物
Uedu Chemistry 優化學
Uedu Electronics 優電子
Uedu Semiconductor 優半導體
Uedu AI 優智慧
Uedu Statistics 優統計
Uedu UAV 優無人機
教材庫
文學館
台灣四百年
Uedu Science 科學實驗室
Teacher Console
Course Setup
Support & Messages
Uptime Data

UeduGPTs

--

Jupyters

0

Local AI

--

CISOSE26 本地 AI UG26
虎尾科技大學 AQI 38 28°C PM2.5 10

AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

More settings
Account settings Data privacy settings Research Informed Consent Form
Uedu Open / Advanced Data Structures
6.851

Advanced Data Structures

Prof. Erik Demaine | Spring 2012
Data Science, Analytics & Computer Technology Algorithms and Data Structures Computer Science Engineering
前往原始課程
CC BY-NC-SA 4.0
課程簡介

Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure.

Acknowledgments

Thanks to videographers Martin Demaine and Justin Zhang.

Course Information
SourceMIT 開放式課程
科系Electrical Engineering and Computer Science
LanguageEnglish
影片數22
課程影片 (22)
1
1. Persistent Data Structures
1. Persistent Data Structures
2
2. Retroactive Data Structures
2. Retroactive Data Structures
3
3. Geometric Structures I
3. Geometric Structures I
4
4. Geometric Structures II
4. Geometric Structures II
5
5. Dynamic Optimality I
5. Dynamic Optimality I
6
6. Dynamic Optimality II
6. Dynamic Optimality II
7
7. Memory Hierarchy Models
7. Memory Hierarchy Models
8
8. Cache-Oblivious Structures I
8. Cache-Oblivious Structures I
9
9. Cache-Oblivious Structures II
9. Cache-Oblivious Structures II
10
10. Dictionaries
10. Dictionaries
11
11. Integer Models
11. Integer Models
12
12. Fusion Trees
12. Fusion Trees
13
13. Integer Lower Bounds
13. Integer Lower Bounds
14
14. Sorting in Linear Time
14. Sorting in Linear Time
15
15. Static Trees
15. Static Trees
16
16. Strings
16. Strings
17
17. Succinct Structures I
17. Succinct Structures I
18
18. Succinct Structures II
18. Succinct Structures II
19
19. Dynamic Graphs I
19. Dynamic Graphs I
20
20. Dynamic Graphs II
20. Dynamic Graphs II
21
21. Dynamic Connectivity Lower Bound
21. Dynamic Connectivity Lower Bound
22
22. History of Memory Models
22. History of Memory Models