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

（）at regular intervals.

题库:初级程序员 类型:最佳选择题 时间:2017-07-03 11:59:44 免费下载:《单项选择》Word试卷

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

（）at regular intervals.
A.but rather
B.rather too
C.rather than
D.rather that

本题关键词:僵a,ECF-A,EP21-A,EP6-A,EP18-A,EP7-A,Lp(a),Lp（a）,A-aDO2,抗A;