问题 阅读理解

Never give out identifying information such as Name, Home Address, School name, or Telephone Number in a public message such as at a chat room or on bulletin bards. Never send a person a picture of you without first checking with your parents or guardian.

● Never respond to messages or bulletin board items that are: Suggestive / Obscene / Belligerent / Threatening / Make You Feel Uncomfortable.

● Be careful when someone offers you something for nothing, such as gifts and money. Be very careful about any offers that involve your coming to a meeting or having someone visit your house.

● Tell your parents or guardian right away if you come across any information that makes you feel uncomfortable.

● Never arrange a face-to-face meeting without telling your parents or guardian. If your parents or guardian agree to the meeting, make sure that you meet in a public place and have a parent or guardian with you.

● Remember that people online may not be who they seem. Because you can’t see or even hear the person, it would be easy for someone to misrepresent him or herself. Thus, someone indicating that“she”is a“12-year-old-girl”could in reality be an older man.

● Be sure that you are dealing with someone that you and your parents know and trust before giving out any personal information about yourself via E-mail.

● Get to know your“online friends”just as you get to know all of your other friends.

小题1:We can infer from the passage that            .

A.it is not safe to surf the internet

B.people now are no longer honest

C.we can chat with unfamiliar people online

D.people online are not who they are小题2:Which of the following is right according to the passage?

A.People online never tell their friends their real names.

B.You can often get something free from the internet.

C.Your friends online may want to meet you.

D.Online friends are not friends at all.小题3:What is the main idea of the passage?

A.How to surf the internet.

B.Kids shouldn’t surf the internet.

C.How to choose online friends.

D.How to protect yourselves online.

答案

小题1:C

小题2:C

小题3:D

题目分析:本文讲述的正是在网络上保护自己不受伤害所要注意的几个方面。

小题1:C 推理题。本文是关于在网络与别人进行交流的注意事项,那么说明我们还是可以和别人在网上进行交流的,只是要注意一些内容。故C项正确。

小题2:C 推理题。根据Never arrange a face-to-face meeting without telling your parents or guardian说明你在网络上的朋友可能会约你见面,但是你不要轻易第赴约。故C项正确。

小题3:D 主旨大意题。本文讲述的正是在网络上保护自己不受伤害所要注意的几个方面。故D项正确

点评:本文讲述的正是在网络上保护自己不受伤害所要注意的几个方面。本文要把题目要求和上下文的文本内容相联系,做出合理的推理和判断,最主要的方法是根据词义关系推断具体细节。

单项选择题 A1型题
问答题

【说明】 所谓货郎担问题,是指给定一个无向图,并已知各边的权,在这样的图中,要找一个闭合回路,使回路经过图中的每一个点,而且回路各边的权之和最小。 应用贪婪法求解该问题。程序先计算由各点构成的所有边的长度(作为边的权值),按长度大小对各边进行排序后,按贪婪准则从排序后的各边中选择边组成回路的边,贪婪准则使得边的选择按各边长度从小到大选择。 函数中使用的预定义符号如下: #define M 100 typedef struct{/*x为两端点p1、p2之间的距离,p1、p2所组成边的长度*/ float x; int p1, p2; }tdr; typedef struct{/*p1、p2为和端点相联系的两个端点,n为端点的度*/ int n, P1, p2; }tr; typedef struct{/*给出两点坐标*/ float x,y; }tpd; typedef int tl[M]; int n=10; 【函数】 float distance(tpd a,tpd b);/*计算端点a、b之间的距离*/void sortArr(tdr a[M], int m);/*将已经计算好的距离关系表按距离大小从小到大排序形成排序表,m为边的条数*/int isCircuit(tr[M], int i, int j);/*判断边(i, j)选入端点关系表r[M]后,是否形成回路,若形成回路返回0*/void selected(tr r[M], int i, int j);/*边(i,j)选入端点关系表r*/void course(tr r[M], tl 1[M]);/*从端点关系表r中得出回路轨迹表*/void exchange(tdr a[M], int m, int b);/*调整表排序表,b表示是否可调,即是否有边长度相同的边存在*/void travling(tpd pd[M], int n, float dist, t1 locus[M])/*dist记录总路程*/{ tdr dr[M];/*距离关系表*/ tr r[M];;/*端点关系表*/ int i, j, k, h, m;/*h表示选入端点关系表中的边数*/ int b;/*标识是否有长度相等的边*/ k=0; /*计算距离关系表中各边的长度*/ for(i=1;i<n;i++){ for(j=i+1;j<=n;j++){ k++; dr[k].x= (1) ; dr[k].p1=i; dr[k].p2=j; } } m=k; sortArr(dr,m);/*按距离大小从小到大排序形成排序表*/ do{ b=1; dist=0; k=h=0; do{k++;i=dr[k].p1;j=dr[k].p2;if((r[i].n<=1)&&(r[j].n<=1)){/*度数不能大于2*/ if( (2) ){ /*若边(i,j)加入r后形成回路,则不能加入*/  (3) ; h++; dist+=dr[k].x; }else if( (4) ){ /*最后一边选入r成回路,则该边必须加入且得到解*/ selected(r,i,j); h++; dist+=dr[k].x; }} }while((k!=n)&&(h!=n)); if(h==n){/*最后一边选入构成回路,完成输出结果*/ course(r,locus); }else{/*找不到解,调整dr,交换表中边长相同的边在表中的顺序,并将b置0*/  (5) ; } }while(!b); }