A.let
B.put
C.got
D.get
第1题:
A、I’m good
B、I’m pleased
C、I’m fine
D、I’m nice
第2题:
John: Well, it's getting late. Maybe we could get together some other time.
Harry: _________.
A、Take it easy
B、Nice to see you back
C、Sounds good
D、I'll give you a call
E、Yes,I've enjoyed it
第3题:
A.RIP路由协议基于Bellman-Ford算法
B.Bellman-Ford算法本质上就是Dijkstra算法
C.Bellman-Ford算法无须知道全网拓扑结构
D.Bellman-Ford算法是链路状态算法
第4题:
Wu Hua had a question to ask his foreign teacher. He went to Professor James's place.After he got the answer, he got up to leave.Wu:()
A、Well, that's clear, thank you very much.
B、Well, I've got to go now.
C、Ok. Thanks.
D、I'm afraid I must go now.
第5题:
判断图中是否有负权回路 Bellman-ford 算法
x[I],y[I],t[I]分别表示第I条边的起点,终点和权。共n个结点和m条边。
procedure bellman-ford
begin
for I:=0 to n-1 do d[I]:=+infinitive;
d[0]:=0;
for I:=1 to n-1 do
for j:=1 to m do {枚举每一条边}
if d[x[j]]+t[j]<d[y[j]] then d[y[j]]:=d[x[j]]+t[j];
for I:=1 to m do
if d[x[j]]+t[j]<d[y[j]] then return false else return true;
end;
第6题:
3.—Mr Zhang,I'm not feeling well. I-d like to have this afternoon _________ to go to a doctor.
—OK.
A.on
B.off
C.down
D.up