I'm tired out. I all afternoon and I don't seem to have finished anything.
A. shopped
B. have shopped
C. had shopped
D. have been shopping
第1题:
按行优先顺序存储下三角矩阵的非零元素,则计算非零元素a/sub>ij1≤j≤i≤n)的地址的公式为
A.LOC(aij)=LOC(all)+i×(i+1)/2+j
B.LOC(aij)=LOC(all)+i×(i+1)/2+(j-1)
C.LOC(aij)=LOC(all)+i×(i-1)/2+j
D.LOC(aij)=LOC(all)+i×(i-1)/2+(j-1)
第2题:
第3题:
下列程序段的时间复杂度为()。 for(i=0; i for(j=0; j c[i][j]=0; for(i=0; i for(j=0; j for(k=0; k c[i][j]=c[i][j]+a[i][k]*b[k][j];
A.O(m*n*t)
B.O(m+n+t)
C.O(m+n*t)
D.O(m*t+n)
第4题:
-- Ann is in hospital.
-- Oh, really? I __ know. I __ go and visit her.
A. didn’t; am going to B. don’t; would
C. don’t; will D. didn't; will
第5题:
下列程序段的时间复杂度是()。 for(i=0; i<m; i++) for(j=0; j<t; j++) c[i][j]=0; for(i=0; i<m; i++) for(j=0; j<t; j++) for(k=0; k<n; k++) c[i][j]=c[i][j]+a[i][k]*b[k][j];
A.O(m+n+t)
B.O(m+n*t)
C.O(m*t+n)
D.O(m*n*t)
第6题:
下列程序段的时间复杂度是()。 for(i=0;i<n;i++) for(j=0;j<m;j++) for(k=0;k<t;k++) c[i][j]=c[i][j]+a[i][k]*b[k][j];
A.O(m+n+t)
B.O(m*n*t)
C.O(m+n*t)
D.O(m*t+n)