4.6 IEEE 802.11标准：无线局域网 4.7 IEEE 802.6标准：DQDB 4.8 局域网性能

4.1 局域网概述 4.2 局域网参考模型 4.3 CSMA/CD和IEEE802.3标准

一、遗传的分离和自由组合定律 二、遗传学数据的统计和分析 三、Mendel定律的扩展

10.3 网络安全

1.1 计算机网络的演变与发展 1.2 计算机网络的功能和应用 1.3 计算机网络的层次体系结构 1.4 网络通信标准化组织 1.5 计算机网络的分类 1.6 实例简介

第五章 C++基础 5.1 C++概述 5.2 数据和表达式 5.3 基本语句 5.4 函数 5.5 数组与指针

Sorting: There is a series of data in random order, we sort them depending a certain key word. Datalist: an finity set of data waiting to be sorted. Key: data object has many attribute areas, namely there are many data element, one of all these elements can be used to distinguish object, we use it as sorting key. we also call it sorting code

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

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 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