一起答

软件水平考试(中级)网络工程师上午(基础知识)试题模拟试卷23

  • 卷面总分:75分
  • 浏览次数:0
  • 测试费用:免费
  • 答案解析:是
  • 练习次数:18次
  • 作答时间:150分钟
试卷简介
部分试题预览
  1. (78)

    • A.Router
    • B.Gateway
    • C.Bridge
    • D.hub
  2. (79)

    • A.NNI
    • B.NRZ
    • C.NAK
    • D.NVT
  3. (76)

    • A.RTP
    • B.RTTP
    • C.FTP
    • D.NNTP
  4. (77)

    • A.ADSL
    • B.FTTC
    • C.HFC
    • D.FTTH
  5. (71) is a one -way function that takes an arbitrarily long piece of plaintext and from it computes a fixed-length bit string.

      (72) is a protocol that most USENET machines now use it to allow news articles to propagate from one machine to another over a reliable connection.

      (73) is an approach preferred by cable TV providers. In this solution the fiber terminates at an optoelectrical converter and the final segment is a shared coaxial cable.

      (74) is a device used to connect two separate network that use different communication protocol.

      (75) is a digital-to-digital polar encoding method in which the signal level is always either positive or negative.

    • A.MD
    • B.RSA
    • C.DES
    • D.MIB
  6. (73)

    • A.routes
    • B.road
    • C.distance
    • D.cost
  7. (74)

    • A.but rather
    • B.rather too
    • C.rather than
    • D.rather that
  8. (71)

    • A.derived from
    • B.deviated from
    • C.was derived from
    • D.was deviated from
  9. (72)

    • A.more
    • B.less
    • C.same
    • D.most
  10. In the following essay, each blank has four choices. Choose the most suitable one from the four choices and write down in the answer sheet.

     Open Shortest Path First(OSPF) is a(66)routing algorithm that(67)work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires(68)processing power. The Dijkstra algorithm is used to calculate(69)OSPF routing table updates only take place when necessary,(70)at regular intervals.

    • A.distance-vector
    • B.link-state
    • C.flow-based
    • D.selective flooding