一起答
单选

●下列作业调度算法中有最短作业平均周转时间的是 (21) 。

(21)

  • A.先来先服务    &n
  • bsp;  B.短作业优先    
  • C.最高响应比优先    
  • D.优先数法
试题出自试卷《2011年程序员考试考前密卷(四)-上午试题》
参考答案
查看试卷详情
相关试题
    • ASCII is a 7-
    • bit
    • co
    • de used to represent numeric,alphabetic,and special printable characters.It also includes codes for control characters,which are (75) .    (75) A.printable or displayable
    • B.not printable or displayable
    • C.not printable but displayable
    • D.printable but not displayable
  1. ●The error mess

    • ages given
    • by a
    • C compiler show the message text,the most common cause of the error,an
    • d a suggestion for  (73) the error.    (73) A.upfsying
    • B.fixing
    • C.changing
    • D.Editing
  2. ●How m

    • any key comparisons are needed in searching for key value 38?&n
    • bsp;(74) .    (74) A.1
    • B.4    
    • C.3    
    • D.2
  3. ●By me

    • ans of multiple pipeline to carry out multiple processing,this technology is called&n
    • bsp;(71) .    (71) A.Multiple pipeling
    • B.Superpipeline    
    • C.Superscalar    
    • D.Very long instruction word
  4. ●Tr

    • ansport gateways connect
    • byte streams in the transport layer.Appli
    • cation gateways allow interworking above (72) .    (72) A.network layer
    • B.
    • data link layer
    • C.transport layer
    • D.appfication layer
    • An instruction that uses indrect addressing mustt contain an address of memory where&n
    • bsp;(69) .    (69) A.data is stored
    • B.a pipeline stall will be exe
    • cute
    • d
    • C.a page fault is addressed
    • D.another address is stored
  5. ●Wh

    • at is the decimal value of the
    • binary value 10010? (70) .    (70) A.18
    • B.20    
    • C.14    
    • D.15
  6. ●In which ph

    • ase of the software engineering process is the Software Requirements Specification developed?&n
    • bsp; (68) .    (68) A.development phase
    • B.engineering phase    
    • C.maintenance phase    
    • D.Definition phase
  7. In a computer,if a logical left shift of the operand occurs,its lowest bit is () .

    • A.unchanged  
    • B.1  
    • C.0  
    • D.random
  8. ● The sorting method described by the code is c

    • alled&n
    • bsp;(67) .    (67) A.Insertion sort
    • B.Sele
    • ction sort
    • C.Ra
    • dix sort
    • D.Merge sort