搜题请搜索小程序“爱下问搜题”
问题 填空题

用所给动词的正确形式完成短文，并将答案依次填在短文中相应的横线上。

Dear Zhang Lin ,

    How's it going? I    1    ( have ) some problems at school. I find it difficult to work in the evening and I can't concentrate on anything at the moment. I spend most of my time   2   ( listen) to records or watching TV instead of doing my homework. The other students in my class __3   ( be ) much better than me. I have the following problems as well.I can't always take down the important things my teacher   4   (say) , because I write too slowly. She   5   ( tell ) me that I'm falling behind my class mates in my studies. I'm not good at  _6   ( write )and I usually hand in my homework late because I won't do it until the last minute. So I often have to find different excuses _7   ( let ) my teacher know why I haven't done the homework. I'm sure I _8   ( get) through my final exam in January.I'm now so far behind the other students that I don't know how I can   9    ( catch ) up with them.Last week, when my teacher _10   ( help ) me with my homework , she. found so many mistakes , which made me more upset.

    Could you please give me some good suggestions?

                                                                                                                                      Yours ,

                                                                                                                                           Wei Hua

答案

1.have  2.listening  3.are  4.says  5.has told  

6.writing 7. to let  8. won't get  9. catch 10. helped

填空题


In the following passage, there are 20 blanks representing the words that are missing from the context. You are to put back in each of the blanks the missing word． The time for this section is 20 minutes.
Where do you really come from And how did you get (1) where you live today DNA studies suggest that all humans today (2) from a group of African ancestors who—about 60,000 years ago— (3) a remarkable journey.
The Genographic Project is seeking to chart new (4) about the migratory history of the human species by (5) sophisticated laboratory and computer analysis of DNA contributed by hundreds of (6) of people from around the world． In this unprecedented and real-time (7) effort, the Genographic Project is closing the gaps of what science (8) today about mankind’s ancient migration stories.
The Genographic Project is a five-year (9) partnership led by National Geographic Explorer-in-Residence Dr. Spencer Wells. Dr. (10) and a team of renowned international scientists and IBM researchers, are (11) cutting-edge genetic and computational technologies to analyze historical patterns in DNA (12) participants around the world to better understand our human genetic roots. (13) three components of the project are: to gather field research data (14) collaboration with indigenous and traditional peoples around the world; to invite (15) general public to join the project by purchasing a Genographic Project Public Participation Kit; (16) to use proceeds from Genographic Public Participation Kit sales to further (17) research and the Genographic Legacy Fund which in (18) supports indigenous conservation and revitalization projects. The Project is anonymous, non-medical, (19) , non-profit and non-commercial and all results will be placed in the (20) domain following scientific peer publication.

查看答案
填空题

阅读以下说明和C代码，将应填入 (n) 处的字句写在对应栏内。

[说明]

下面程序用来将打乱的单词还原为原来的次序，比如将rty还原为try。单词的原来次序存储于wordlist.txt文件中，原则上可用穷举法(rty对应的穷举为：rty、ryt、try、tyr、ytr、yrt)，但考虑到破译速度，采用如下方法。

注意到单词列表中不存在组成字符完全相同的单词(如Hack12与Hack21包含完全相同的字符)，因此将单词中的字符进行重组再进行比较，例如，try单词重组为rty(按ASCⅡ码顺序)，这样不管打乱的单词是什么顺序，只要是由r、t、y三个字母组成的均破译为try，大大提高破译速度。程序中借助二叉排序树以进一步提高查找效率，二叉排序树左子树(如果有)上的节点对应的值均小于根节点的值，右子树(如果有)上的节点对应的值均大于根节点的值。

函数中使用的符号定义如下：

#define NumberofWords 1275//单词总数

#define MaxLength 10//最长单词所含字符数

char WordList[NumberofWords][MaxLength]；//存储单词列表

int cmp(Node *q，Node *p)；//q与p比较。p小，返回负值；P大返回正值：相等，返回0

typedef struct Node(//二叉树节点

char *eleLetters；//重组后的字符串

int index；//对应单词表中的下标

struct Node *lChiId，*rChiid；//左右子节点

}Node；

[C代码]

void reCompose(Node *p，char *temp)

//重纰，亦即将temp字符串中的字符升序排序，存储于p节点中

//采用直接插入排序法

{

char c；

strcpy(p-＞eleLetters，temp)；//

int len=strlen(temp)；

int i，j，k；

for(i=0；i＜len－1；i++){

k=i；

for(j=i+1；j＜lan；j++){

if(p-＞eleLetters[j]＜P-＞eleLetters[k])k=J；

}

if( (1) ){

C=P-＞eleLetters[i]；

P-＞eleLetters[i]=P-＞eleLetters[k]；

P-＞eleLetters[k]=c；

}//if

}//for

}；

int find(Node &root，char *temp)

//在二叉排序树root中查找与temp匹配的单词。

//若匹配返回相应单词在WordList中下标；若查找失败，返回-1

{

Node *P，*q；

int flag；

P= (2) ；//临时存储

reCompose(p，temp)；//将temp重组

q=&root；

while((flag= (3) )＆＆q !=NULL){

if(flag＜0){//搜索左子树

q=q-＞lChiid；

}else(//搜索右子树

q=q-＞rChild；

}

}//while

if(flag==0){//找到匹配的，保存下标

return (4) ；

}

}

if( (5) ){//查找失败

printf("cant unscramble the following word：%s"，temp)；；

return -1；

}

}；

（1）处填（）。
查看答案