国产aaa大片,电视剧父母全集在线观看,雾夜屠夫电影完整版在线观看,瞄准电视剧大全在线观看,国产精品电影,chinese国产hdsex18一19高清,97超级碰碰碰视频在线观看

軟題庫 學(xué)習(xí)課程
當(dāng)前位置:信管網(wǎng) >> 在線考試中心 >> 網(wǎng)絡(luò)工程師題庫 >> 試題查看
試卷名稱
考試中心《》在線考試
試卷年份2017年上半年
試題題型【單選題】
試題內(nèi)容

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

查看答案

相關(guān)試題



更多試題