I’ve never seen him read any those books on the shelves. They are just for show.() 此题为判断题(对，错)。
I’ve never seen him read any those books on the shelves. They are just for show.()
此题为判断题(对，错)。
相关考题：
31. --- Can you come on Monday or Tuesday?---I’m afraid _______ day is possible.A. neitherB. either C. some D. any
Saul's brother left the matter entirely up to ______ and ______.A. I, heB. him, IC. me, heD. him, me
My sister has_____ been to the Summer Palace. I ’m going to take her there.A.everB.sometimeC.never
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;
30、如下程序的输出结果是 int main（) { char books[][20]={"English","Math","Physical"}; int i,j; for（i=0;i＜3;i++) { for（j=0;books[i][j]!=0;j++){ if（books[i][0]＜books[i][j]) books[i][0]= books[i][j]; } } printf（"%c",books[0][0]); return 0; }A．EB．sC．nD．h
29、如下程序的输出结果是 int main（) { char books[][20]={"English","Math","Physical"}; int i,j; for（i=0;i＜3;i++) { strcat（books[i],"book"); } printf（"%s",books[i-1][3]); return 0; }A．PhysicalbookB．sicalC．PhysicalD．sicalbook