在CPU中用于跟踪指令地址的寄存器是（1）。

指令系统中采用不同寻址方式的目的是(2).

在计算机系统中采用总线结构，便于实现系统的积木化构造，同时可以(3).

某计算机系统由下图所示的部件构成，假定每个部件的千小时可靠度都为R，则该系统的千小时可靠度为(4)。

软件产品的可靠性并不取决于(5)。

模块A直接访问模块B的内部数据，则模块A和模块B的耦合类型为(6)。

下列关于风险的叙述不正确的是：风险是指(7)

下列关于项目估算方法的叙述不正确的是(8)。

下图是一个软件项目的活动图，其中顶点表示项目里程碑，边表示包含的活动，边上的权重表示活动的持续时间，则里程碑(9)在关键路径上。

下列关于软件著作权中翻译权的叙述不正确的是：翻译权是指(10)的权利

10Base-T以太网使用曼彻斯特编码，其编码效率为（11) %，在快速以太网中使用4B/5B编码，其编码效率为（12) %。

10Base-T以太网使用曼彻斯特编码，其编码效率为（11) %，在快速以太网中使用4B/5B编码，其编码效率为（12) %。

在相隔400km的两地间通过电缆以4800b/s的速率传送3000比特长的数据包，从开始发送到接收完数据需要的时间是(13)。

假设模拟信号的最高频率为10MHz，采样频率必须大于(14)时,才能使得到的样本信号不失真。

数据链路协议HDLC%2C target=_blank>HDLC是一种(15) .

快速以太网标准100Base-TX规定的传输介质是(16)。

以太网交换机的交换方式有三种，这三种交换方式不包括(17)。

Cisco路由器操作系统IOS有三种命令模式，其中不包括（18) 。

通过CATV电缆访问因特网，在用户端必须安装的设备是（19)。

在互联网中可以采用不同的路由选择算法，所谓松散源路由是指IP分组（20) 。

下面关于边界网关协议BGP4的描述中，不正确的是（21)。

RIP协议中可以使用多种方法防止路由循环，在以下选项中不属于这些方法的是(22)。

RIP协议默认的路由更新周期是(23)秒。

OSPF协议适用于4种网络。下面的选项中，属于广播多址网络的是（24)，属于非广播多址网络的是（25)。

OSPF协议适用于4种网络。下面的选项中，属于广播多址网络的是（24)，属于非广播多址网络的是（25)。

MPLS (多协议标记交换）根据标记对分组进行交换，MPLS包头的位置应插入在（26),

IGRP协议的路由度量包括多种因素，但是在一般情况下可以简化为（27)。

釆用Windows Server 2003创建一个Web站点，主目录中添加主页文件index.asp后，在客户机的浏览器地址栏内输入该网站的域名后不能正常访问，则不可能的原因是（28)。

DNS服务器在名称解析过程中正确的查询顺序为（29) 。

DNS服务器进行域名解析时，若采用递归方法，发送的域名请求为（30)。

若DNS资源记录中记录类型（record-type)为A，则记录的值为（31).

FTP客户上传文件时，通过服务器20端口建立的连接是（32)，客户端应用进程的端口可以为（33) 。

FTP客户上传文件时，通过服务器20端口建立的连接是（32)，客户端应用进程的端口可以为（33) 。

在Linux系统中，命令（34)用于管理各项软件包。

Linux系统中，为某一个文件在另外一个位置建立一个文件链接的命令为（35),

默认情况下，Linux系统中用户登录密码信息存放在（36)文件中。

若要显示IP路由表的内容，可以使用命令(37),

下列命令中，不能查看网关IP地址的是（38) 。

某网络拓扑如下图所示，在主机host1上设置默认路由的命令为（39)；在主机host1上增加一条到服务器server1主机路由的命令为（40)。

某网络拓扑如下图所示，在主机host1上设置默认路由的命令为（39)；在主机host1上增加一条到服务器server1主机路由的命令为（40)。

在SNMPv3中，把管理站（Manager)和代理（Agent)统一叫做 （41)。

下列选项中，同属于报文摘要算法的是（42)。

下图所示为一种数字签名方案，网上传送的报文是（43)，防止A抵赖的证据是（44)。

下图所示为一种数字签名方案，网上传送的报文是（43)，防止A抵赖的证据是（44)。

下面关于域本地组的说法中，正确的是（45) 。

在Kerberos认证系统中，用户首先向（46）申请初始票据，然后从（47)获得会话密钥。

在Kerberos认证系统中，用户首先向（46）申请初始票据，然后从（47)获得会话密钥。

HTTPS的安全机制工作在（48)，而S-HTTP的安全机制工作在 （49）

HTTPS的安全机制工作在（48)，而S-HTTP的安全机制工作在 （49）

下面病毒中，属于蠕虫病毒的是（50)。

互联网规定的B类私网IP地址为（51).

如果一个公司有2000台主机，则必须给它分配（52)个C类网络。为了使该公司网络在路由表中只占一行，指定给它的子网掩码应该是（53).

如果一个公司有2000台主机，则必须给它分配（52)个C类网络。为了使该公司网络在路由表中只占一行，指定给它的子网掩码应该是（53).

ISP分配给某公司的地址块为199.34.76.64/28,则该公司得到的地址数是（54)。

由16个C类网络组成一个超网（supernet),其网络掩码（mask)应为（55)。

设IP地址为18.250.31.14，子网掩码为255.240.0.0,则子网地址是（56)。

IPv6的《链路本地地址》是将主机的（57)附加在地址前缀1111 1110 10之后产生的。

如果要设置交换机的IP地址，则命令行提示符应该是（58）。

路由器命令 《Router(config-subif)# encapsulation dotlq 1》 的作用是（59) °

若路由器显示的路由信息如下，则最后一行路由信息是怎样得到的？ (60)。
R3#show ip route
Gateway of last resort is not set
192.168.0.0/24 is subnetted, 6 subnets
C 192.168.1.0 is directly connected, Ethernet0
C 192.168.65.0 is directly connected, Serial0
C 192.168.67.0 is directly connected, Serial 1
R 192.168.69.0 [120/1] via 192.168.67.2, 00:00:15, Serial1
[120/1] via 192.168.65.2, 00:00:24, Serial0
R 192.168.5.0 [120/1] via 192.168.67.2, 00:00:15,Serial1
R 192.168.3.0 [120/1] via 192.168.65.2, 00:00:24, Serial0

按照802.1d生成树协议（STP),在交换机互连的局网中，(61)的交换机被选为根交换机。

以太网中采用了二进制指数后退算法，这个算法的特点是（62)。

以太网帧格式如下图所示，其中《填充》字段的作用是（63) 。

IEEE802.11采用了 CSMA/CA协议，下面关于这个协议的描述中错误的是（64)。

在IEEE 802.11标准中使用了扩频通信技术，下面选项中有关扩频通信的说法中正确的是（65)。

Wi-Fi联盟制定的安全认证方案WPA (Wi-Fi Protected Access)是（66)标准的子集。

为了确定一个网络是否可以连通，主机应该发送ICMP (67)报文。

在域名系统中，根域下面是顶级域（TLD)。在下面的选项中（68)属于全世界通用的顶级域。

在网络设计阶段进行通信流量分析时可以采用简单的80/20规则，下面关于这种规则的说明中，正确的是（69)。

根据用户需求选择正确的网络技术是保证网络建设成功的关键，在选择网络技术时应考虑多种因素。下面的各种考虑中，不正确的是（70)。

Border Gateway Protocol (BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) .A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing methoD. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing (75) using the Dijkstra algorism.

Border Gateway Protocol (BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) .A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing methoD. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing (75) using the Dijkstra algorism.

Border Gateway Protocol (BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) .A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing methoD. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing (75) using the Dijkstra algorism.

Border Gateway Protocol (BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) .A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing methoD. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing (75) using the Dijkstra algorism.

Border Gateway Protocol (BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) .A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing methoD. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing (75) using the Dijkstra algorism.