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

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

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

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

本章基本要求 一、掌握轴心受压构件的受力特点及承载力计算方法。重点掌握普通配箍构件轴心受压构件的计算;理解配置螺旋箍筋轴压构件承载力提高的原理。 二、掌握偏心受压构件的受力特性;两类偏压构件的特点与判别;受压构件纵向弯曲的影响。 三、掌握矩形截面非对称和对称偏心受压构件的正截面承载力的计算公式、适用条件及公式应用。 四、一般掌握I形截面对称配筋偏压构件的承载力计算。 五、了解截面承载力N与M的关系。 六、掌握受压构件的构造要求