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

上海交通大学：《创新思维与现代设计》教学资源_创新性自检与抄袭规避

上海交通大学：《创新思维与现代设计》教学资源_2018秋季班_软件培训_计算机辅助系统介绍及Solid works操作指南

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

复旦大学：《学术英语（社会科学）》知识讲座_“学”无止境 “术”有教法——记“学术英语课程设计与教学方法研修班

复旦大学：《护理科研》课程知识点课件（护理研究）量性研究设计的常用方法

复旦大学：《设计与制造 Design and Manufacture》课程教学资源（教学大纲）Design and Manufacture