北京大学：《数据结构与算法》精品课程教学资源（教学大纲）

1. Mathematical Background 2. Computer Representation 3. Graph Traversal 4. Topological Sorting 5. A Greedy Algorithm: Shortest Paths 6. Minimal Spanning Trees 7. Graphs as Data Structures

1. Orchards, Trees, and Binary Trees 2. Lexicographic Search Trees: Tries 3. External Searching: B-Trees 4. Red-Black Trees Pointers and Pitfalls

1. Introduction, Notation 2. Sequential Search 3. Binary Search 4. Comparison Trees 5. Lower Bounds 6. Asymptotic 7. Pointers and Pitfalls

1. Specifications for Queues 2. Implementation of Queues 3. Contiguous Queues in C++ 4. Demonstration and Testing 5. Application: Airport Simulation 6. Pointers and Pitfalls

2.1 线性表的定义 2.2 线性表的顺序存储结构 2.3 线性表的链式存储结构

西安建筑科技大学：《数据结构与算法》教学资源（课程设计题目任务书）用Dijkstra方法求最短路径

12.1 Polynomial time algorithms 12.2 Undecidable 12.3 NP-complete 12.4 Approximation algorithms 12.5 Dealing with hard problems

11.1 String matching problem 11.2 Naive string-matching algorithm 11.3 Rabin-Karp algorithm 11.4 Finite automaton 11.5 Knuth-Morris-Pratt algorithm

9.1 Activity-selection problem 9.2 Introduction to greedy solution 9.3 Steps of the greedy strategy 9.4 Knapsack problem 9.5 Huffman code