-Must I finish the report today?-_____________________. You can finish it tomorrow.
A.Yes, you must
B.No, you mustn't.
C.No, you don't have to
A.Yes, you must
B.No, you mustn't.
C.No, you don't have to
A.mustn’t
B.may not
C.couldn’t
D.needn’t
Why do I want to go to college? No one has ever asked me 11 a question. But many times I have asked myself. I have 12 a whole variety of reasons. 13 important reason is that I want to be a better man. Many things make human beings different 14 or better than or even superior to animals. One of the most important things is 15. If I fail to receive higher education, my education 16. As I want to be a fully 17 man, I must get a well-rounded education, which good colleges and universities are supposed to 18. I know one can get educated in many ways, but colleges and universities are 19 the best places to teach me how to educate myself. Only when I am well-educated, will I be a better human being and 20 fit into society.
11、A.quite
B.so
C.such
D.another
12、A.come up with
B.agreed with
C.been fed up with
D.got on well with
13、A.Most
B.The most
C.More
D.Much
14、A.to
B.around
C.between
D.from
15、A.education
B.weather
C.temperature
D.science
16、A.finished
B.don’t finish
C.will not finish
D.has finished
17、A.develop
B.developed
C.developing
D.experience
18、A.improve
B.graduate
C.hear
D.provide
19、A.between
B.among
C.inside
D.outside
20、A.can good
B.may better
C.be able to better
D.able to best
"Must we finish the work in an hour?"
"No, you ()."
A. don't
B. needn't
C. mustn't
D. can't
“Must we finish the work in an hour”“N0,you().”
A.don’t
B.needn’t
C.mustn’t
D.can’t
A.ble to change in new situations
B.time by which you must finish something
C.ind the way around something
D.make something new
E.make or do something again
A.finish
B.to finish
C.finishing
D.finished
A.a…the
B.a…a
C.the…the
D.the…a
阅读下列函数说明和C代码,回答下面问题。
[说明]
冒泡排序算法的基本思想是:对于无序序列(假设扫描方向为从前向后,进行升序排列),两两比较相邻数据,若反序则交换,直到没有反序为止。一般情况下,整个冒泡排序需要进行众(1≤k≤n)趟冒泡操作,冒泡排序的结束条件是在某一趟排序过程中没有进行数据交换。若数据初态为正序时,只需1趟扫描,而数据初态为反序时,需进行n-1趟扫描。在冒泡排序中,一趟扫描有可能无数据交换,也有可能有一次或多次数据交换,在传统的冒泡排序算法及近年的一些改进的算法中[2,3],只记录一趟扫描有无数据交换的信息,对数据交换发生的位置信息则不予处理。为了充分利用这一信息,可以在一趟全局扫描中,对每一反序数据对进行局部冒泡排序处理,称之为局部冒泡排序。
局部冒泡排序的基本思想是:对于N个待排序数据组成的序列,在一趟从前向后扫描待排数据序列时,两两比较相邻数据,若反序则对后一个数据作一趟前向的局部冒泡排序,即用冒泡的排序方法把反序对的后一个数据向前排到适合的位置。扫描第—对数据对,若反序,对第2个数据向前冒泡,使前两个数据成为,有序序列;扫描第二对数据对,若反序,对第3个数据向前冒泡,使得前3个数据变成有序序列;……;扫描第i对数据对时,其前i个数据已成有序序列,若第i对数据对反序,则对第i+1个数据向前冒泡,使前i+1个数据成有序序列;……;依次类推,直至处理完第n-1对数据对。当扫描完第n-1对数据对后,N个待排序数据已成了有序序列,此时排序算法结束。该算法只对待排序列作局部的冒泡处理,局部冒泡算法的
名称由此得来。
以下为C语言设计的实现局部冒泡排序策略的算法,根据说明及算法代码回答问题1和问题2。
[变量说明]
define N=100 //排序的数据量
typedef struct{ //排序结点
int key;
info datatype;
......
}node;
node SortData[N]; //待排序的数据组
node类型为待排序的记录(或称结点)。数组SortData[]为待排序记录的全体称为一个文件。key是作为排序依据的字段,称为排序码。datatype是与具体问题有关的数据类型。下面是用C语言实现的排序函数,参数R[]为待排序数组,n是待排序数组的维数,Finish为完成标志。
[算法代码]
void Part-BubbleSort (node R[], int n)
{
int=0 ; //定义向前局部冒泡排序的循环变量
//暂时结点,存放交换数据
node tempnode;
for (int i=0;i<n-1;i++) ;
if (R[i].key>R[i+1].key)
{
(1)
while ((2) )
{
tempnode=R[j] ;
(3)
R[j-1]=tempnode ;
Finish=false ;
(4)
} // end while
} // end if
} // end for
} // end function
阅读下列函数说明和C代码,将应填入(n)处的字句写在的对应栏内。
Shall we go out for dinner tonight?().
A.No, you can't
B.Yes, please
C.Thank you, I don't want to
D.Sorry, I have a report to finish
在窗体上画一个文本框,然后编写如下代码: Option Base 1 Private Sub Form_Click() Dim arr Dim Start As Integer,Finish As Integer Dim Sum As Integer arr=Array(12,4,8,16) Start=Lbound(arr) Finish=Ubound(arr) Sum=0 For i=Start To Finish Sum=Sum+arr(i) Next i c=Sum/Finish Text1.Text=c End Sub 程序运行后,单击窗体,则在文本框中显示的内容是
A.40
B.10
C.12
D.16