全国计算机等级考试四级含金量-2017年全国计算机等级考试四级练习试题及答案2

副标题:2017年全国计算机等级考试四级练习试题及答案2

时间:2023-11-05 18:43:01 阅读: 最新文章 文档下载
说明:文章内容仅供预览,部分内容可能不全。下载后的文档,内容与下面显示的完全一致。下载之前请确认下面内容是否您想要的,是否完整无缺。


  (41) 在关系数据库设计中,使每个关系达到某一范式。这是哪个设计阶段的任务?
  A.需求分析
  B.概念设计
  C.逻辑设计
  D.物理设计

  (42) 在指令编码设计过程中,虽然有化的编码方法,但人们仍采用
  A.ASCII码进行指令编码
  B.BCD码进行指令编码
  C.哈夫曼码进行指令编码
  D.等长扩展码进行指令编码

  (43) 寄存器窗口重叠技术是RISC的关键技术,这项技术能很好地支持过程调用和返回操作。这里所谓的重叠是指
  A.高位寄存器与低位寄存器重叠
  B.高位寄存器与局部寄存器重叠
  C.全局寄存器与局部寄存器重叠
  D.全局寄存器与高位寄存器重叠

  (44) 奔腾处理器已普遍采用超标量流水线技术。所谓超标量技术就是
  A.把普通流水线的主频提高
  B.多建立几条流水线而已
  C.不采用多指令分发技术
  D.细化流水、增加级数

  (45) 下列哪种结构是把指令和数据混合进行存储的
  A.哈佛结构
  B.马克结构
  C.冯.诺依曼结构
  D.非冯.诺依曼结构

  (46) 虚拟存储系统的页式管理。每个页都是一个
  A.等长模块
  B.等长页面
  C.逻辑实体
  D.模块实体

  (47) 高速并行结构的种类很多。在下述结构中,硬件效率而软件需求量最少的是
  A.专用多功能单元
  B.阵列处理机
  C.数据流计算机
  D.多处理机系统

  (48) 所谓I/O操作是指内存与I/O设备之间进行信息交换。在I/O方式的发展过程中,对CPU依赖程度的I/O操作是
  A.通道控制
  B.中断控制
  C.程序控制
  D.DMA控制

  (49) 计算机 网络 按照其覆盖的地理范围可以分为哪几种基本类型?
  Ⅰ.局域网
  Ⅱ.城域网
  Ⅲ.数据通信网
  Ⅳ.广域网
  A.Ⅰ和Ⅱ
  B.Ⅲ和Ⅳ
  C.Ⅰ、Ⅱ和Ⅲ
  D.Ⅰ、Ⅱ和Ⅳ

  (50) 计算机网络拓扑是**网中结点与通信线路之间的几何关系来反映出网络中各实体间的
  A.逻辑关系
  B.服务关系
  C.结构关系
  D.层次关系

  (51) 由于连接多台计算机之间的线路结构可能是复杂的,因此决定分组如何从通信子网的源结点到达目的结点时需要使用
  A.拥塞算法
  B.路由选择算法
  C.差错控制算法
  D.排队算法

  (52) 在网络环境中进行大型科学计算、信息处理时,需要数据通信网能提供较高的带宽。这一类数据通信具有哪些主要特征?
  Ⅰ.通信量大
  Ⅱ.顺序性
  Ⅲ.突发性
  Ⅳ.层次性
  A.Ⅲ和Ⅳ
  B.Ⅰ和Ⅲ
  C.Ⅰ、Ⅱ和Ⅳ
  D.Ⅱ和Ⅳ

  (53) IEEE 802标准所描述的局域网参考模型对应于OSI参考模型的哪一(几)层?
  Ⅰ.逻辑链路控制层
  Ⅱ.数据链路层
  Ⅲ. 网络 层
  Ⅳ.物理
  A.只有Ⅱ
  B.Ⅱ、Ⅲ和Ⅳ C)Ⅱ和Ⅳ
  D.Ⅰ、Ⅱ和Ⅲ

  (54) 与快速以太网 Fatt Ethernet相同之处是:千兆位以太Gigabit Ethernet同样保留着传统的10 Mbps Ethernet的基本特征,而且把每个比特的发送时间降低为
  A.100ns
  B.10ns
  C.0.1ns
  D.1ns

  (55) Internet的基本服务,如电子邮件E-mail、远程登录Telnet、文件传输FTP与WWW浏 览等,它们的应用软件系统设计中都采用了
  A.客户机/服务器结构
  B.逻辑结构
  C.层次模型结构
  D.并行体系结构

  (56) An instruction that uses indrect addressing mustt contain an address of memory where
  A.data is stored
  B.a pipeline stall will be executed
  C.a page fault is addressed
  D.another address is stored

  (57) The principle for a stack memory to store data is
  A.FIFO
  B.FILO
  C.random
  D.other way

  (58) In the forest corresponding to the following binary tree,how many children does node B have?
  A.1
  B.2
  C.3
  D.4

  (59) For the root of B_tree of order m,the minimal number of its children is
  A.2
  B.ëm/2û
  C.ém/2ù
  D.m

  (60) A disk scheduling mechanism in an operating system causes the disk arm to sweepback and forth across the disk surface servicing all requests in its path. This is a
  A.First Come First Serve
  B.Shortest Seek Time First
  C.Scan
  D.None of the above


  (61) The construct
  cobegin
  Statement1;
  Statement2;
  coend
  means Statement1 and Statement2 are to be executed in parallel. The only two atomic actions in this construct are loading the value of a variable and storing into a variable. For the program segment
  x:=0;
  y:=O;
  cobegin
  begin
  x:=l;
  y:=y+x;
  end;
  begin
  y:=2;
  x:=x+3;
  end
  coend
  Which of the following indicate(s) possible values for the variables when the segment finishes execution?
  Ⅰ.x=1,y=2
  Ⅱ.x=1,y=3
  Ⅲ.x=4,y=6
  A.Ⅰ
  B.Ⅰ and Ⅱ C)Ⅰ and Ⅲ
  D.Ⅱ and Ⅲ

  (62) Software maintenance is to do necessary modification,supplenemt, and completeness during software life circle. Among the following vary kinds of maintenance,which one has the maximum workload in a general way?
  A.relevance maintenance
  B.completeness maintenance
  C.correctness naintenance
  D.other kinds of maintenance

  (63) Different quality factors of software can be reflected upon user’s different points of view,through product running,product modification and product transformation. Of the following properties,which one is connected with product running?
  Ⅰ.correctness Ⅱ.robustness Ⅲ.re-use
  A.Ⅰonly
  B.Ⅱonly
  C.Ⅰ+Ⅱ
  D.all of above

  (64) Let R and S be the relation respectively:
  Relation R: A B C Relation S: B C D
   1 2 3 2 3 4
   6 7 8 2 3 5
   9 7 8 7 8 1
  The number of tuples that the result of the expression R ∞ S (Here is the natural join of relations R and S) is
  A.3
  B.4
  C.6
  D.9

  (65) Suppose we have the relation schema R(A,B,C,
  D.with functional dependencies;F{A→B,B→C,C→D,D→A},then R(A,B,C,D)at least is in
  A.1NF
  B.2NF
  C.3NF
  D.BCNF

  (66) By means of multiple pipeline to carry out multiple processing,this technologyiscalled
  A.Multiple pipeling
  B.Superpipeline
  C.Superscalar
  D.Very long instruction word

  (67) There are many page replacement algorithms in the page management. Most frequently used algorithm is
  A.FIFO
  B.PPT
  C.OPT
  D.LRU

  (68) Layer n on one machine carries on a conversation with layer n on another machine. The rules and conventions used in this conversation are collectively known as the layer n
  A.topology
  B.protocol
  C.service
  D.peer

  (69) Transport gateways connect byte streams in the transport layer. Application gateways allow interworking above
  A.network layer
  B.data link layer
  C.transport layer
  D.application layer

  (70) Every host and router on the Internet has an IP address, which encodes its
  A.host number
  B.host number and socket
  C.network number
  D.host number and network number

2017年全国计算机等级考试四级练习试题及答案2.doc

本文来源:https://www.wddqw.com/xaiO.html