💎 高级数据结构 | Advanced Data Structure

约 219 个字 预计阅读时间 1 分钟

课程信息

上课请带上纸 & 笔

课程评分方法: Homework(10') + Discussions(10') + Research Project(30') + Midterm(10'*'/机房测试) + Final(40'/可覆盖期中考试成绩)

Research topics (30')

• Done in groups of 4
• choose 2 out of 7 topics
• Report ((20+20)/2 points)
• In-class presentation (10 minutes, 10 points)
• The speaker will be chosen randomly from all the contributors
• If there are many volunteers, at first 4 groups will be chosen to give presentations (5 groups forthe last 2 projects)
• For those groups not to give presentations, each will gain bonus points = report points / 20

笔记相关

参考笔记：

• https://www.yuque.com/xianyuxuan/saltfish_shop/course_res_index#cIhfl

List

• Lecture 1 | AVL Trees & Splay Trees & Amortized Analysis
• Lecture 2 | Red Black Tree & B+ Tree
• Lecture 3 | Inverted File Index
• Lecture 4 | Leftist Heaps & Skew Heaps
• Lecture 5 | Binominal Trees
• Lecture 6 | Backtracing
• Lecture 7 | Divide & Conquer
• Lecture 8 | Dynamic Programming
• Lecture 9 | Greedy Algorithms
• Lecture 10 | NP Completeness
• Lecture 11 | Approximation
• Lecture 12 | Local Search
• Lecture 13 | Randomized Algorithms
• Lecture 14 | Parallel

• Lecture 15 | External Sorting

• Topic 1 | Amortized Analysis