下列数组声明正确的是()。
A.r=8 : Dim a (1 to r) as integer
B.Dim a(10) as integer : ReDim a(1 to x)
C.Dim a(x) as single : ReDim a(3,6) as integer
D.Dim a() as integer : x=8 : ReDim a(1 to x) as integer
A.r=8 : Dim a (1 to r) as integer
B.Dim a(10) as integer : ReDim a(1 to x)
C.Dim a(x) as single : ReDim a(3,6) as integer
D.Dim a() as integer : x=8 : ReDim a(1 to x) as integer
(50)
A. 8
B. 12
C. 33
D. 48
下列数组声明语句中,正确的是
A.Dim A[3,4]As Integer
B.Dim A(3,4)As Integer
C.Dim A[3;4]As Integer
D.Dim A(3;4)As Integer
下列数组声明语句中,正确的是
A.Dim A[3,4]As Integer
B.Dim A(3,4)As Integer
C.Dim A[3;4]As Integer
D.Dim A(3;4)As Integer
(31 )下列数组声明语句中,正确的是
A ) dim A[3,4] As integer
B ) dim A(3,4) As integer
C ) dim A[3;4] As integer
D ) dim A(3;4) As integer
●试题一
阅读下列算法说明和算法,将应填入(n)处的语句写在答题纸的对应栏内。
【说明】
为了减少直接插入排序关键字的比较次数,本算法使用了二分(折半)插入法对一个无序数组R[1..n]进行排序。排序思想是对一个待插入元素,先通过二分法(折半)找到插入位置,后移元素后将该元素插入到恰当位置(假设R[]中的元素互不相同)。
【算法】
1.变量声明
X:DataType
i,j,low,high,mid,R0..n
2.每循环一次插入一个R[i]
循环:i以1为步长,从2到n,反复执行
①准备
X<-R[i]; (1) ;high<-i-1;
②找插入位置
循环:当 (2) 时,反复执行
(3)
若X.key<R[mid].key
则high<-mid-1
否则 (4)
③后移
循环:j以-1为步长,从 (5) ,反复执行
R[j+1]<-R[j]
④插入
R[low]<-X
3.算法结束
A.Dim A[3,4]As Integer
B.Dim A(3,4)As Integer
C.Dim A[3;4]As Integer
D.Dim A(3;4)As Integer
A.inta[]={1,2,3,5};
B.inta[4]={1,2,3,4,5};
C.chara[4]={A,B,C,D};
D.chara[4]="ABCD";
A.a[30]="ThisisaCprogram.";
B.a="ThisisaCprogram.";
C.p="ThisisaCprogram.";
D.strcpy(p,"ThisisaCprogram.");
A.n=6 : Dim a (1 to n) as integer
B.Dim a(10) as integer : ReDim a(1 to 12)
C.Dim a() as single : ReDim a(3,6) as integer
D.Dim a() as integer : n=6 : ReDim a(1 to n) as integer
A.8
B.5
C.4
D.2