G( V, E ) where G ::= graph, V = V( G ) ::= finite nonempty set of vertices, and E = E( G ) ::= finite set of edges

1 Preliminaries 1. Terminology Lineal Tree Pedigree Tree ( binary tree )

A stack is a Last-In-First-Out (LIFO) list, that is, an ordered list in which insertions and deletions are made at the top only. Objects: A finite ordered list with zero or more elements

【Definition】An Abstract Data Type (ADT) is a data type that is organized in such a way that the specification on the objects and specification of the operations on the objects are separated from the representation of the objects and the implementation on the operations

【Definition】An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria: (1) Input There are zero or more quantities that are externally supplied

1 Equivalence Relations 【Definition】A relation R is defined on a set S if for every pair of elements (a, b), a, b S, a R b is either true or false. If a R b is true, then we say that a is related to b

变量的作用域（空间特性） 变量的作用域也称为可见性，指变量能够被访问的范围。 分为局部变量和全局变量两类：局部变量的范围较窄，限定在程序中的部分区域；全局变量的范围较宽，可以是整个文件甚至是整个程序

文件：存储在外部介质上数据的集合,是操作系统数据管理的单位，能永久保存数据

结构体 一、结构体是一种构造数据类型 二、用途：把不同类型的数据组合成一个整体-------自定义数据类型

一、函数的定义和调用及返回值 二、数据在函数间的传递方式 三、数组名作实参 四、通过指针调用函数 五、带参数的主函数(命令行参数) 六、两类特殊函数