午夜无码中文字幕影院,国产自产第一区c国产,久久久久久夜精品精品免费,国产99久久,夜夜夜夜曰天天天天拍国产,欧美日韩亚洲另类专区,国产精品区一区二区免费

軟題庫(kù) 培訓(xùn)課程
試卷年份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)試題