UeduGPTs

--

Jupyters

2

AI 回覆桌面通知

AI 助教回覆完成時顯示桌面通知

聊天訊息通知

同學在討論區發送訊息時通知

聲音通知

每當有新通知時播放提示音

更多設定

帳戶設定資料隱私設定研究知情同意書

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.

課程資訊

來源	MIT 開放式課程
科系	Electrical Engineering and Computer Science
語言	English
影片數	22

課程影片 (22)

1. Persistent Data Structures

1. Persistent Data Structures

2. Retroactive Data Structures

2. Retroactive Data Structures

3. Geometric Structures I

3. Geometric Structures I

4. Geometric Structures II

4. Geometric Structures II

5. Dynamic Optimality I

5. Dynamic Optimality I

6. Dynamic Optimality II

6. Dynamic Optimality II

7. Memory Hierarchy Models

7. Memory Hierarchy Models

8. Cache-Oblivious Structures I

8. Cache-Oblivious Structures I

9. Cache-Oblivious Structures II

9. Cache-Oblivious Structures II

10. Dictionaries

10. Dictionaries

11. Integer Models

11. Integer Models

12. Fusion Trees

12. Fusion Trees

13. Integer Lower Bounds

13. Integer Lower Bounds

14. Sorting in Linear Time

14. Sorting in Linear Time

15. Static Trees

15. Static Trees

17. Succinct Structures I

17. Succinct Structures I

18. Succinct Structures II

18. Succinct Structures II

19. Dynamic Graphs I

19. Dynamic Graphs I

20. Dynamic Graphs II

20. Dynamic Graphs II

21. Dynamic Connectivity Lower Bound

21. Dynamic Connectivity Lower Bound

22. History of Memory Models

22. History of Memory Models