试题与答案

阅读短文,根据短文内容回答问题。(共10分,每小题2分) Confidence

题型:阅读理解

题目:

阅读短文,根据短文内容回答问题。(共10分,每小题2分)

Confidence is very important in daily life. It can help you to develop a healthy attitude. A study shows that the people who are more confident are much happier. They can have more chance to make themselves successful. But how to be more confident? Here are some suggestions:

Speak loud   When you are not confident, you can’t do well what you want to do. You speak in a voice so low that other people can hardly hear you. Try to speak loud enough so that people can hear you clearly. The high voice can help you become more confident.

Play sports   Physical exercise makes you tired but completely relaxed. A strong body helps you be full of confidence.

Encourage yourself  Write down a list of things you did during the day to see how many things you have done well. Did you finish your homework? Did you tell a joke that made everybody laugh? Give yourself praise for the good things you’ve done.

Get rid of (消除) fear  Fear comes along with failure. But it’s easy to overcome (克服) if you know that failure is part of your life. Don’t hide your head just because you said something stupid last time. Try to start again and believe you can do better.

Pick up a hobby   If you like singing, sing as much as you can. In some ways, a hobby can make you outstanding. And it will make you happy and confident.

小题1:Is confidence important in daily life?

小题2:How many suggestions can help you to be more confident?

小题3:Which can help you be more confident, speak in a low voice or speak loud?

小题4:How can you encourage yourself?

小题5:What’s the passage mainly about?

答案:

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

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

D

试题推荐
题型:单项选择题

二叉排序树的存储结构定义为以下类型:
typedef int KeyType;
typedef struct node
KeyType key; /*关键字项*/
InfoType otherinfo; /*其它数据项*/
struet node*lchild,*rchild; /*左、右孩子指针*/
BSTNode,*BSTree;
阅读算法f33,并回答问题:


(1)对如图所示的二叉排序树T,写出f33(T,8)返回的指针所指结点的关键字;
(2)在哪些情况下算法f33返回空指针
(3)简述算法f33的功能。
BSTNode*f33(BSTree T,KeyType x)
BSTNode*P;
if(T==NULL)return NULL;
p=f33(T—>lehild,x);
if(p!=NULL)return p;
if(T—>key>x)return T;
return f33(T—>rchild,x);

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