高级数据结构与算法分析

约 120 个字 预计阅读时间不到 1 分钟

任课教师：张国川

成绩组成

• 期末以外部分累计不超过 60%
  • Homework 10%
  • Discussions 10%++
  • project 30%
  • 期中 10%
• 期末 40%

Data Structures

• Balanced Search Trees:
  • AVL Tree, Splay Tree
  • B+ Tree
  • Red-Black Tree
• Leftist Heaps, Skew Heaps
• Binomial Queue
• Inverted File Index

Algorithms

• Divide and Conquer
• Backtracking, Dynamic Programming
• Greedy Algorithms, Local Search
• NP-Completeness, Approximation Algorithms
• Randomized Algorithms, Parallel Algorithms
• External Sorting

Table of Contents

• AVL Trees, Splay Trees,and Amortized Analysis
• Red-Black Trees and B+ Trees
• Inverted File Index
• Leftist Heaps and Skew Heaps
• Binomial Queue
• Backtracking
• Divide and Conquer

Comments