一、过程化基础 二、项目开发过程 类 三、构造函数和析构函数 四、继承与派生 五、多态性

Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

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

第七章图 选择题 1.图中有关路径的定义是()。【

第9章集合 选择题

第四章栈和队列 一、栈 二、表达式求值 三、队列 四、优先队列

一、图的基本概念 二、图的存储表示 三、图的遍历与连通性 四、最小生成树 五、最短路径 六、活动网络

(C)1.在一个图中,所有顶点的度数之和等于图的边数的倍。 A.1/2 B.1 C.2 D.4