上海交通大学：《设计与制造 Design and Manufacturing Ⅰ》课程教学资源（课件讲义）Lec16_UG建模特征操作

上海交通大学：《设计与制造 Design and Manufacturing Ⅰ》课程教学资源（课件讲义）Lec14_UG建模

上海交通大学：《设计与制造 Design and Manufacturing Ⅰ》课程教学资源（课件讲义）Lec13_UG草图

上海交通大学：《设计与制造 Design and Manufacturing Ⅰ》课程教学资源（课件讲义）Lec12_UG界面

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

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

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

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

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

2.1 Divide-and-conquer design paradigm 2.2 Recurrence for merge sort and binary search 2.3 Powering a number 2.4 Fibonacci numbers 2.5 Recursive squaring 2.6 Matrix multiplication 2.7 Strassen's algorithm