3.1 Definition of data structure 3.2 Stacks 3.3 Queues 3.4 Linked lists 3.5 Trees 3.6 Postfix expression 3.7 Infix to postfix conversion

5.1 Dictionary problem 5.2 Hash functions 5.3 Collisions resolution by chaining 5.4 Open addressing 5.5 Probing strategies: linear, quadratic, and double hashing 5.6 Analysis of open addressing

7.1 Introduction to amortized analysis 7.2 Aggregate method 7.3 Accounting method 7.4 Potential method 7.5 Dynamic tables

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

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

• 计数设备：用于计数系统 • 多道分析器：用于能量分析系统、时间分析系统

复旦大学：《税法 Tax Law》硕士毕业论文_开征环境保护税对我国重污染企业盈利能力的影响——基于 A 股上市重污染企业面板数据的实证研究

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

10.1 Graph representations 10.2 Breadth-first and depth-first search algorithms 10.3 Topological sort 10.4 Disjoint sets and strategy of union by rank and path compression 10.5 Minimum spanning tree 10.6 Prim's and Kruskal's algorithm 10.7 Single-source shortest-paths algorithms: breadth-first search, Dag shortest paths, Dijkstra algorithm, and Bellman-Ford algorithm 10.8 All-pairs shortest-paths algorithms: brute-force, dynamic programming, Floyd-Warshall algorithm, and Johnson algorithm 10.9 Ford-Fulkerson max-flow algorithm and Edmonds-Karp algorithm

8.1 Manufacturing problem 8.2 Matrix-chain multiplication 8.3 Elements of dynamic programming 8.4 Four steps of development 8.5 Longest common subsequence problem