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 (36) routing algorithm that (37) work clone on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (38) processing power. The (39) algorithm is used to calculate routes. OSPF routing table updates only take place when necessary, (40) at regular intervals.

A:derived from B:deviated from C:was derived from D:was deviated from

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 (36) routing algorithm that (37) work clone on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (38) processing power. The (39) algorithm is used to calculate routes. OSPF routing table updates only take place when necessary, (40) at regular intervals.

A:derived from B:deviated from C:was derived from D:was deviated from

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 （） 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.

A:derived from B:deviated from C:was derived from D:was deviated from

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 (1) routing algorithm that (2) work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (3) processing power. The (4) algorithm is used to calculate routes. OSPF routing table updates only take place when necessary, (5) at regular intervals.

A:derived from B:deviated from C:was derived from D:was deviated from

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 (1) routing algorithm that (2) work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (3) processing power. The Dijkstra algorithm is used to calculate (4) OSPF routing table updates only take place when necessary, (5) at regular intervals.

A:derived from B:deviated from C:was derived from D:was deviated from

有以下程序 #include ＜iostream＞ #include ＜string＞ using namespace std; class base { private: char baseName[10]; public: base （　） { strcpy(baseName,"Base"); } virtual char *myName（　） { return baseName; } char *className（　） { return baseName; } }; class Derived : public base { private: char derivedName[10]; public: Derived（　） { strcpy(derivedName,"Derived"); } char *myName（　） { return derivedName; } char *className（　） { return derivedName; } }; void showPtr(base &p) { cout＜＜p.myName （　） ＜＜" "＜＜p.className （　）; } int main （　） { base bb; Derived dd; showPtr(dd); return 0; } 运行后的输出结果为

A:Derived Base B:Base Base C:Derived Derived D:Base Derived

有以下程序 #include ＜iostream＞ #include ＜string＞ using namespace std; class base { private: char baseName[10]; public: base（　） { strcpy(baseName,"Base"); } virtual char *myName（　） { return baseName; } char *className（　） { Return baseName; } }; class Derived: public base { private: char derivedName[10]; public: Derived（　） { strcpy(derivedName,"Derived" ); } char *myName（　） { return derivedName; } char *className（　） { return derivedName; } }; void showPtr(base &p) { cout＜＜p.myName（　）＜＜" "＜＜p.className（　）; } int main（　） { base bb; Derived dd; showPtr(dd); return 0; } 运行后的输出结果为

A:Derived Base B:Base Base C:Derived Derived D:Base Derived

有如下程序:#nclude ＜iostream＞using namespace std;class Base{ public:void fun1（　） {cout ＜＜ "Base/n"; }virtual void fun2（　） {cout ＜＜ "Base/n"; }};class Derived: public Base{ public:void fun1（　） {cout ＜＜ "Derived/n"; }void fun2（　） {cout ＜＜ "Derived/n"; }} void f(Base& b) { B. fun1（　）; B. fun2（　）; }int main（　）{Derived obj;f(obj);return 0;}

A:Base Base B:Base Derived C:Derived Base D:Derived Derived

有如下程序： #include＜iostream＞ using namespace std； class Base { public: void funl（　）{cout＜＜"Basea"；} virtual void fun2（　）{tout＜＜"Base/n"；} }； class Derived：public Base { public: void funl（　） {cout＜＜"Derived/n"; } void fun2（　） {cout＜＜"Derived/n"; } }; void f(Base& b) {b.funl（　）; b.fun2（　）; } int main（　） { Derived obj; f(obj); return 0; } 执行这个程序的输出结果是

A:Base　　Base B:Base　　Derived C:Derived　　Base D:Derived　　Derived