国产成人精品一区二区三区电影,亚洲色图吧,中文天堂在线观看,极限特工1电影完整版在线观看,日韩高清一二三区,色戒未删完整版电影,夏日情人完整版未删减在线观看

軟題庫 學習課程
當前位置:信管網 >> 在線考試中心 >> 網絡工程師題庫 >> 試題查看
試卷名稱
考試中心《》在線考試
試卷年份2017年上半年
試題題型【單選題】
試題內容

If two communicating entities are in different hosts connected by a network,there is a risk that PDUs will not arrive inthe order inwhich theywere sent , becausethey may traverse(70)paths through the network. If each PDUs is given a uniquenumber,andnumbersareassigned(71),thenit isa logicallysimpletaskforthereceivingentityto reorder(72 )PDUsonthebasisofsequence number.Aproblem with this scheme is that,with a(73)sequence number field, sequence number will repeat.Evidently , the maximumsequence numbermustbe(74)thanthemaximumnumber ofPDUsthatcouldbe outstandingat anytime.
(70)A.same
B.different
C.single
D.Unique
(71)A.randomly
B.equally
C. uniformly
D. Sequentially 
(72)A.received
B.sent
C.transmitting
D.Forwarding
(73)A.various
B.diverse
C.finite
D.infinite 
(74)A.smaller
B.greater
C.less
D.More

查看答案

相關試題



更多試題