A.would do
B.will have done
D.has done
D.had done
第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题:
A. mv /home/operator .
B. mv /home/operator/* .
C. mv /home/operator ../..
D. mv /home/operator/all ../home/operator
第3题:
第4题:
webbrowser1.document.all(i).tagname
webbrowser1.document.all(i).name
webbrowser1.document.all(i).value
第5题:
( 11 )请在下列程序的空白处,填上适当的内容:
Import java. awt. *;
Import java. util. *;
Class BufferTest{
Public static void main(string args[])
Throws IOException{
FileOutputStream unbuf=
new FileOutputStream( “ test.one ” ) ;
BufferedOutputStream buf=
new 【 11 】 (new FileOutputStream( “ test.two ” ));
System.out.println
( “ write file unbuffered: ” + time(unbuf) + “ ms ” );
System.out.println
( “ write file buffered: ” + time(buf) + “ ms ” );
}
Static int time (OutputStream os)
Throws IOException{
Date then = new Date();
for (int i=0; i<50000; i++){
os.write(1);
}
}
os.close();
return(int)(()new Date()).getTime() - then.getTime());
}
第6题: