首页>计算机等级考试>模拟试题>正文
2010年下半年全国计算机等级考试四级试题(五)

www.zige365.com 2010-7-5 11:15:39 点击:发送给好友 和学友门交流一下 收藏到我的会员中心
    (61) There are several periods in a computer,the shortest period is
  A.Instruction period
  B.Machine period
  C.Beat period
  D.CPU period

  (62) Which set is empty?
  A.{xx is a real number and x2=9 B){xx is a real number and x2-1=0}
  C){xx is a real number and x2+1=0} D){xx is a real number and x=2x+1}

  (63) What is the relation represented in the exhibit shown below?
  A.R={(1,2),(1,3),(1,4),(1,5)}
  B.R={(1,1),(2,2),(3,3),(4,4),(5,5)}
  C.R={(1,2),(1,3),(1,4),(2,3),(4,1),(4,5),(5,5)}
  D.R={(1,2),(1,3),(1,4),(2,2),(2,3),(4,1),(4,4),(4,5)}

  (64) What is the contrapositive of the following implication?“If it is raining,then I get wet.”
  A.If I get wet,then it is raining.
  B.If I am wet ,then if is raining.
  C.If it is not raining, I do not get wet.
  D.If I do not get wet,then it is not raining.

  (65) Which property does R posses? (2 grades)
  Let A={1,2,3,4} and let R ={<1,2>,<2,2>,<3,4>,<4,1>}
  A.Symmetry
  B.Reflexivity
  C.Asymmetry
  D.Antisymmetry

  (66) When walking a tree, which traversal method yields a prefix, or Polish,form?
  A.lnorder
  B.Preorder
  C.Postorder
  D.Reorder

 

  (67) ln the following statements about graph operations, which one is NOT correct?
  (2 grades)
  A.Spanning tree of a graph may not be unique.
  B.Minimum spanning tree of a graph may not be unique.
  C.Finding critical path is an operation on directed graph.
  D.Finding critical path is an operation on undirected graph.

  (68) Which traversal method for a binary tree does the following Pascal code illustrate? (2 grades)
  procedure traverse(p:pointer);
  begin
  if p<>nil
  then begin
  traverse(p↑.left);
  process(p);
  traverse(p↑.right)
  end
  end;
  A.lnorder
  B.Preorder
  C.Postorder
  D.Reorder

  (69) What storage scheme does MS-DOS use for storing files on a disk?
  A.I-nodes
  B.a linked list allocation
  C.a continuous allocation
  D.a linked list with index

  (70) Which of the followings is NOT a condition for deadlock?

       

A.Starvation
  B.Circular Wait
  C.No Preemption
  D.Mutual Exclusion

  (71) Assume that an operating system uses a round-robin scheduler. The process’s quantum is 20 msec,and the context switch is 5 msec. What percentage of the CPU’s time is spent on administrative overhead? (2 grades)
  A.5%
  B.15%
  C.20%
  D.25%

  (72) What state is a process in when it can’t run because it needs a resource to become available? (2 grades)
  A.Ready
  B.Interrupt
  C.Blocked
  D.Running

  (73) The following sectors are requested from the disk:
  11,1,36,16,34,9,12
  What is the order of the sector reads if you are using the elevator algorithm?
  (2 grades)
  A.1,9,11,12,16,34,36
  B.11,1,36,16,34,9,12
  C.11,12,9,16,1,34,36
  D.11,12,16,34,36,9,1

  (74) What is the candidate key of a relational database?

本新闻共5页,当前在第1页  1  2  3  4  5  

我要投稿 新闻来源: 编辑: 作者:
相关新闻
2010年全国计算机等级考试四级试题(二)