具有3个节点的二叉树有（ ）种形态。 A、2 B、3 C、5 D、7
【题目61】
以下关于二叉排序树（或二叉查找树、二叉搜索树）的叙述中，正确的是（ ） 。 A、对二叉排序树进行先序、中序和后序遍历，都得到结点关键字的有序序列 B、含有n个结点的二叉排序树高度为（log2n）+1
C、从根到任意一个叶子结点的路径上，结点的关键字呈现有序排列的特点 D、从左到右排列同层次的结点，其关键字呈现有序排列的特点
【题目62】
下表为某文件中字符的出现频率，采用霍夫曼编码对下列字符编码，则字符序列“bee”的编码为（62）；编码“110001001101”的对应的字符序列为（63）。
A、10111011101 B、10111001100 C、001100100 D、110011011
【题目63】
下表为某文件中字符的出现频率，采用霍夫曼编码对下列字符编码，则字符序列“bee”的编码为（62）；编码“110001001101”的对应的字符序列为（63）。
21
A、bad B、bee C、face D、bace
【题目64】
两个矩阵Am*n和Bn*p相乘，用基本的方法进行，则需要的乘法次数为m*n*p。多个矩阵相乘满足结合律，不同的乘法顺序所需要的乘法次数不同。考虑采用动态规划方法确定Mi，M(i+1)，…，Mj多个矩阵连乘的最优顺序，即所需要的乘法次数最少。最少乘法次数用m[i,j]
表示，其递归式定义为：其
中i、j和k为矩阵下标，矩阵序列中Mi的维度为（pi-1）*pi采用自底向上的方法实现该算法来确定n个矩阵相乘的顺序，其时间复杂度为（64）。若四个矩阵M1、 M2、M3、M4相乘的维度序列为2、6、3、10、3，采用上述算法求解，则乘法次数为（65）。 A、O（n） B、O（nlgn） C、O（n） D、O（nlgn）
【题目65】
两个矩阵Am*n和Bn*p相乘，用基本的方法进行，则需要的乘法次数为m*n*p。多个矩阵相乘满足结合律，不同的乘法顺序所需要的乘法次数不同。考虑采用动态规划方法确定Mi，M(i+1)，…，Mj多个矩阵连乘的最优顺序，即所需要的乘法次数最少。最少乘法次数用m[i,j]
3322
表示，其递归式定义为：其
中i、j和k为矩阵下标，矩阵序列中Mi的维度为（pi-1）*pi采用自底向上的方法实现该算法来确定n个矩阵相乘的顺序，其时间复杂度为（64）。若四个矩阵M1、 M2、M3、M4相乘的维度序列为2、6、3、10、3，采用上述算法求解，则乘法次数为（65）。 A、156
22
B、144 C、180 D、360
【题目66】
以下协议中属于应用层协议的是（66），该协议的报文封装在（67）。 A、SNMP B、ARP C、ICMP D、X.25
【题目67】
以下协议中属于应用层协议的是（66），该协议的报文封装在（67）。 A、TCP B、IP C、UDP D、ICMP
【题目68】
某公司内部使用wb.xyz.com.cn作为访问某服务器的地址，其中wb是（ ）。 A、主机名 B、协议名 C、目录名 D、文件名
【题目69】
如果路由器收到了多个路由协议转发的关于某个目标的多条路由，那么决定采用哪条路由的策略是（ ）。
A、选择与自己路由协议相同的
23
B、选择路由费用最小的 C、比较各个路由的管理距离 D、比较各个路由协议的版本
【题目70】
与地址220.112.179.92匹配的路由表的表项是（ ）。 A、220.112.145.32/22 B、220.112.145.64/22 C、220.112.147.64/22 D、220.112.177.64/22
【题目71】
Software entities are more complex for their size than perhaps any other human construct, because no two parts are alike (at least above the statement level). If they are, we make the two similar parts into one, a（71）, open or closed. In this respect software systems differ profoundly from computers,buildings, or automobiles, where repeated elements abound.Digital computers are themselves more complex than most things people build; they have very large numbers of states. This makes conceiving, describing, and testing them hard. Software systems have orders of magnitude more （72）than computers do.Likewise, a scaling-up of a software entity is not merely a repetition of the same elements in larger size; it is necessarily an increase in the number of different elements. In most cases, the elements interact with each other in some（73）fashion,and the complexity of the whole increases much more than linearly.The complexity of software is a(an)（74）property, not an accidental one. Hence descriptions of a software entity that abstract away its complexity often abstract away its essence.Mathematics and the physical sciences made great strides for three centuries by constructing simplified models of complex phenomena, deriving properties from the models, and verifying those properties experimentally. This worked because the complexities（75）in the models were not
24
the essential properties of the phenomena. It does not work when the complexities are the essence.Many of the classical problems of developing software products derive from this essential complexity and its nonlinear increases with size. Not only technical problems but management problems as well come from the complexity. A、task B、job C、subroutine D、program
【题目72】
Software entities are more complex for their size than perhaps any other human construct, because no two parts are alike (at least above the statement level). If they are, we make the two similar parts into one, a（71）, open or closed. In this respect software systems differ profoundly from computers,buildings, or automobiles, where repeated elements abound.Digital computers are themselves more complex than most things people build; they have very large numbers of states. This makes conceiving, describing, and testing them hard. Software systems have orders of magnitude more （72）than computers do.Likewise, a scaling-up of a software entity is not merely a repetition of the same elements in larger size; it is necessarily an increase in the number of different elements. In most cases, the elements interact with each other in some（73）fashion,and the complexity of the whole increases much more than linearly.The complexity of software is a(an)（74）property, not an accidental one. Hence descriptions of a software entity that abstract away its complexity often abstract away its essence.Mathematics and the physical sciences made great strides for three centuries by constructing simplified models of complex phenomena, deriving properties from the models, and verifying those properties experimentally. This worked because the complexities（75）in the models were not the essential properties of the phenomena. It does not work when the complexities are the essence.Many of the classical problems of developing software products
25
相关推荐：
loading