A、think...as
B、regard...as
C、believe...as
D、know...as
第1题:
乳牙萌出的顺序为
A.I→Ⅱ→Ⅳ→Ⅲ→V
B.I→Ⅱ→Ⅲ→]V→V
C.I→Ⅲ→Ⅱ→Ⅳ→V
D.Ⅱ→I→Ⅲ→Ⅳ→V
E.Ⅱ→I→Ⅳ→Ⅲ→V
第2题:
I've _____ these lines again and again but I still keep forgetting them.
A. gone off
B. gone about
C. gone over
D. gone through
第3题:
Techniques that can improve communication include:
A establishing a single, one-way communications channel
B avoiding face-to-face communication
C using redundancy (i.e. saying it two different ways) whenever possible
D disregarding the sensitivity of your receiver
E All of the above.
第4题:
第5题:
执行下列程序,显示的结果是【 】。
ne="WORK"
two=""
a=LEN(one)
i=a
DO WHILE i>=l
two=two+SUBSTR(one,i, 1)
i=i-1
ENDDO
?two
第6题:
( 10 )执行下列程序,显示的结果是 【 10 】 。
one= "WORK"
two = ""
a = LEN ( one )
i = a
DO WHILE i>=1
two = two + SUBSTR ( one ,i , 1 )
i=i - 1
ENDDO
? two
第7题:
A. what
B. any
C. which
D. that
第8题:
--I need some thing for cut ting the paper.
--Oh,you wan takn ife?OK,I'llget______foryou.
A.it
B.that
C.this
D.one
第9题:
B 宽度优先(种子染色法)
5.关键路径
几个定义: 顶点1为源点,n为汇点。
a. 顶点事件最早发生时间Ve[j], Ve [j] = max{ Ve [j] + w[I,j] },其中Ve (1) = 0;
b. 顶点事件最晚发生时间 Vl[j], Vl [j] = min{ Vl[j] – w[I,j] },其中 Vl(n) = Ve(n);
c. 边活动最早开始时间 Ee[I], 若边I由<j,k>表示,则Ee[I] = Ve[j];
d. 边活动最晚开始时间 El[I], 若边I由<j,k>表示,则El[I] = Vl[k] – w[j,k];
若 Ee[j] = El[j] ,则活动j为关键活动,由关键活动组成的路径为关键路径。
求解方法:
a. 从源点起topsort,判断是否有回路并计算Ve;
第10题: