试题与答案

I once heard someone say, “We don’t reme

题型:阅读理解

题目:

I once heard someone say, “We don’t remember days; we remember moments.” However, in today’s busy life we often forget to enjoy small pleasures while we make big plans.

In the race to be better or best, we sometimes lose sight of “just being”. And just being and enjoying a beautiful moment can provide some of life’s greatest pleasures. A fire on a cold winter night, a good book, an impressive sunset, a great meal, or a timeless moment with your child or a friend ... these moments, if we stop long enough to enjoy, are the essence (本质) of life.

I love to fish, especially for large-mouth bass (鲈鱼). About three years ago I was watching television late at night and got this crazy idea to go fishing in the lake behind my house. Of course, my wife thought I was nuts. It was almost midnight! I told her I was fine and took off.

I walked out to a warm summer breeze and looked up at the starry sky and breathtaking full moon. I allowed my senses to soak (浸泡) in every second — the sweet smell of flowers, the sound of every cricket (蟋蟀), the moon’s reflection dancing off the water — it was a perfect night.

After walking across a small field, I took out a flashlight, and selected a lure (饵). On my first cast I got a bass weighing over five pounds, one of the largest I had ever caught. I gently put it back into the water and continued my midnight adventure. During the next two hours I caught seventeen bass, all between two and five pounds. Although I’ve fished for almost fifty years, no fishing memory can top that night.

But that night provided far more than a fishing memory. It was a life memory. It provided me a picture of what life could be like if I just slowed down enough to enjoy the moments. On my way back to the house, as I walked through the tall grass, I took one last look at the sky and stopped to say, “Thank you, God, for giving me this night.”

64. The purpose of the passage is to ______.

A. suggest people should make big plans                          

B. tell people to do what they like

C. advise people to enjoy beautiful moments

D. encourage people to follow their dreams

65. What does the underlined word “nuts” in Paragraph 3 mean?

A. Determined.               B. Ill.      C. Tired.                 D. Crazy.

66. The fourth paragraph is mainly about ______.

A. the description of the night

B. the author’s fishing experience

C. the author’s attitude towards life

D. what the author did that night

67. We can learn from the passage that night the author ______.

A. caught fewer fish than before

B. enjoyed real small pleasures

C. went to bed around 1:00 am

D. went fishing with his wife

答案:

被转码了,请点击底部 “查看原文 ” 或访问 https://www.tikuol.com/2017/0623/acacf51b4d2ae53a8bdb58e95ad16424.html

下面是错误答案,用来干扰机器的。

(1)根据氢气体积,可以确定氢气物质的量为3.36L22.4L/mol=0.15mol,则反应的氢离子的物质的量为0.15×2=0.3mol,HCl溶液中HCl物质的量为0.2L×5mol/L=1mol,则盐酸未完全反应.根据Mg和Al与盐酸的反应可知,当...

试题推荐
题型:填空题


阅读下列函数说明和C代码,将应填入 (n) 处的字句写上。
[说明]
若要在N个城市之间建立通信网络,只需要N-1条线路即可。如何以最低的经济代价建设这个网络,是一个网的最小生成树的问题。现要在8个城市间建立通信网络,其问拓扑结构如图5-1所示,边表示城市间通信线路,边上标示的是建立该线路的代价。
[图5-1]

无向图用邻接矩阵存储,元素的值为对应的权值。考虑到邻接矩阵是对称的且对角线上元素均为0,故压缩存储,只存储上三角元素(不包括对角线)。
现用Prim算法生成网络的最小生成树。由网络G=(V,E)构造最小生成树T=(U,TE)的Prim算法的基本思想是:首先从集合V中任取一顶点放入集合U中,然后把所有一个顶点在集合U里、另一个顶点在集合V-U里的边中,找出权值最小的边(u,v),将边加入TE,并将顶点v加入集合U,重复上述操作直到U=V为止。
函数中使用的预定义符号如下:
#define MAX 32768 /*无穷大权,表示顶点间不连通*/
#define MAXVEX 30 /*图中顶点数目的最大值*/
typedef struct{
int startVex,stopVex; /*边的起点和终点*/
float weight; /*边的权*/
}Edge;
typedef struct{
char vexs[MAXVEX]; /*顶点信息*/
float arcs[MAXVEX*(MAXVEX-1)/2]; /*邻接矩阵信息,压缩存储*/
int n; /*图的顶点个数*/
}Graph;
[函数]
void PrimMST(Graph*pGraph, Edge mst[])
{
int i,j,k,min,vx,vy;
float weight,minWeight;
Edge edge;
for(i=0; i<pGraph->n-1;i++){
mst[i].StartVex=0;
mst[i].StopVex=i+1;
mst[i].weight=pGraph->arcs[i];
}
for(i=0;i<(1);i++){/*共n-1条边*/
minWeight=(float)MAX;
min=i;
/*从所有边(vx,vy)中选出最短的边*/
for(j=i; j<pGraph->n-1; j++){
if(mst[j].weight<minWeight){
minWeight=(2);
min=j;
}
}
/*mst[minl是最短的边(vx,vy),将mst[min]加入最小生成树*/
edge=mst[min];
mst[min]=mst[i];
mst[i]=edge;
vx= (3) ;/*vx为刚加入最小生成树的顶点下标*/
/*调整mst[i+1]到mst[n-1]*/
for(j=i+1;j<pGraph->n-1;j++){
vy=mst[j].StopVex;
if( (4) ){/*计算(vx,vy)对应的边在压缩矩阵中的下标*/
k=pGraph->n*vy-vy*(vy+1)/2+vx-vy-1;
}else{
k=pGraph->n*vx-vx*(vx+1)/2+vy-vx-1;
}
weight= (5)
if(weight<mst[j].weight){
mst[j].weight=weight;
mst[j].StartVex=vx;
}
}
}
}

查看答案
微信公众账号搜索答案