试题与答案

Jackie Chan was born on 7th April, 1954

题型:阅读理解

题目:

Jackie Chan was born on 7th April, 1954 in Hong Kong. His parents left the mainland(大陆) for Hong Kong a short time before he was born. His parents named him Chan Gangsheng, which means “born in Hong Kong”. When Jackie was 7 years old, his family moved to Australia. Later that year, they got back to Hong Kong and Jackie’s father sent him to Beijing to study and work. When Jackie was 17, he began to do dangerous performances(表演) in films. In the early 1980s, Jackie went to Hollywood, but he wasn’t successful there. He went on to make films in Hong Kong and had great success. Finally, in 1985, Jackie Chan became a movie star in the United States. Today Jackie Chan has fans all over the world.

小题1:Where was Jackie Chan from?

A.Sydney.

B.Hollywood.

C.Hong Kong.

D.Beijing.小题2:Which name means “born in Hong Kong”?

A.Chan Gangsheng.

B.Jackie Chan.

C.Cheng Long.

D.Chan Yuanlong.小题3:When did Jackie’s father send him to Beijing to study?

A.In 1954.

B.In 1961.

C.In 1971.

D.In 1980.小题4:What did Jackie begin to do when he was seventeen?

A.Study films.

B.Sing songs.

C.Do performances in films.

D.Make films in Hollywood.小题5:Which of the following is the same meaning with the underlined word “finally”?

A.On the end.

B.As a result.

C.Right now.

D.At last.

答案:

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

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

1;0;9;1—9;0—9;8(或9)

试题推荐
题型:问答题

【说明】
函数print(BinTreeNode*t; DateType &x)的功能是在二叉树中查找值为x的结点,并打印该结点所有祖先结点。在此算法中,假设值为x的结点不多于一个。此算法采用后序的非递归遍历形式。因为退栈时需要区分右子树。函数中使用栈ST保存结点指针ptr以及标志tag,Top是栈顶指针。
【函数】
void print( BinTreeNode * t; DateType &x)
stack ST; int i, top; top = 0;//置空栈
while(t! = NULL &&t-> data!= x || top!=0)
while(t!= NULL && t-> data!=x)

/*寻找值为x的结点*/
(1) ;
ST[top]. ptr = t;
ST[top]. tag = 0;
(2) ;

if(t!= Null && t -> data == x) /*找到值为x的结点*/
for(i=1; (3) ;i ++)
printf("%d" ,ST[top]. ptr ->data);
else
while( (4) )
top--;
if(top>0)

ST[top]. tag = 1;
(5) ;


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