一、链式法则 二、全微分的形式不变性 三、小结与思考题

一、主要内容 二、典型例题

一、准备知识 二、格林公式 三、典型例题分析 四、格林公式在积分学中的地位

一、高斯公式 二、简单应用 三、通量与散度 四、小结

The purpose and contents of the course Introduce most used data structures and algorithms Prerequisite of other courses Introduce algorithm analysis Review C++

3.1 Preface 1. data object--- a set of instances or values for example: Boolean={ false,true} Digit={0,1,2,3,4,5,6,7,8,9} Letter={A, B, ....., a,b, ..... Z} NaturalNumber= {0, 1,2, ..... Integer={0,+1,-1,+2,-2,+3,-3,} String={a,, ..... ,aa, ab, ac

5.1 definition of stack Definition A stack is a linear list in which insertions and deletions take place at the same end. This end is called the top. The other end of the list is called the bottom. It is also called a LIFO(last-in-first-out) list

7.1 Dictionaries A dictionary is a collection of elements each element has a field called key, and no two elements have the same key value. Operations: Insert(x): insert an element with a specified key value Search(k,x): search an element with a specified key

9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value

Main topics Definition of graphs and some terminology Three common graph representations Some algorithms