● The Rational Unified Process (RUP) is a software engineering process, which captures any of best practices in modern software development. The notions of  （71）  and scenarios ave been proven to be an excellent way to capture function requirements. RUP can be described two dimensions – time and content. In the time dimension, the software lifecycle is broken into cycles. Each cycle is divided into four consecutive   （72）  which is concluded with awell-defined （73）    and can be further broken down into  （74）    – a complete developmentloop resulting in a release of an executable product, a subset of the final product underdevelopment, which grows incrementally to become the final system. The content structurerefers to the disciplines, which group   （75）   logically by nature

.

● 电子邮件应用程序利用POP3协议 （68） 。

（68）

● The Rational Unified Process (RUP) is a software engineering process, which captures any of best practices in modern software development. The notions of  （71）  and scenarios ave been proven to be an excellent way to capture function requirements. RUP can be described two dimensions – time and content. In the time dimension, the software lifecycle is broken into cycles. Each cycle is divided into four consecutive   （72）  which is concluded with awell-defined （73）    and can be further broken down into  （74）    – a complete developmentloop resulting in a release of an executable product, a subset of the final product underdevelopment, which grows incrementally to become the final system. The content structurerefers to the disciplines, which group   （75）   logically by nature

.

● 在进行金融业务系统的网络设计时，应该优先考虑（69）原则。在进行企业网络的需求分析时，应该首先进行（70） 。

（69）

● 在 FTP协议中，控制连接是由 （66） 主动建立的。

（66）

● 网页中代码定义了 （67） 。

（67）

● 关于算法与数据结构的关系， （64） 是正确的

（64）

● 若一个问题既可以用迭代方式也可以用递归方式求解，则 （65） 方法具有更高的时空效率。

（65）

● 对于二叉查找树（Binary Search Tree） ，若其左子树非空，则左子树上所有结点的值均小于根结点的值；若其右子树非空，则右子树上所有结点的值均大于根结点的值；左、右子树本身就是两棵二叉查找树。因此，对任意一棵二叉查找树进行 （61）  遍历可以得到一个结点元素的递增序列。在具有 n 个结点的二叉查找树上进行查找运算，最坏情况下的算法复杂度为  （62）  。

（61）

● 迪杰斯特拉（Dijkstra)算法按照路径长度递增的方式求解单源点最短路径问题，该算法运用了 （63） 算法策略

（63）

● 对于 n（n≥0）个元素构成的线性序列 L，在 （60）  时适合采用链式存储结构

（60）