问题 阅读理解

阅读理解。

     The film "Avatar" has received great popularity around the world. It turned out to be a great success.

The film got $1 billion in ticket sales in a very short time. The story in the film happens on an alien(外星人) planet called Pandora where many strange species live. Among the planet's inhabitants(居民,栖息动物),the one that has the most similarities with humans is the Na'vi, and it is the struggle between the Ma'vi

and human invaders (入侵者) that forms the story of the film.

     As to the factors (因素) leading to the film's success, many think that the entertaining feast(盛宴) for

the eyes and the wonderful story shouldn't be forgotten, but the new language invented especially for the

film which provides audiences with a new experience also plays an important part.

     In order to increase the truthfulness of an alien race(外星人), the film's director James Cameron asked an expert in languages from the University of Southern California to invent a language for the Na'vi. Professor Paul Frommer combined the languages spoken among Indians, Africans and mid-Asians and worked

with James Caneron for four years to create the Na'vi language based on the original 30 words that the

director had already come up with.

     According to Professor Frommer, the most important characteristic(特征)of the Na'vi language is that

it could be pronounced. "This is an alien language but obviously it has to be spoken by human actors and

actresses," Professor Frommer told the BBC, "it has to sound natural and it should make human beings

comfortable when using it."

     The language has a vocabulary of around 1000 words but Progessor Formmer hopes to enlarge the

vocabulary in possible follow-ups to the film and in video games. The professor hopes that one day his

creation will be as successful as the Klingon alien language from the "Star Trek"films. "There's a

translation of Hamlet into Klingon and it has received great popularity among the audiences," says

Professor Frommer,"if anything like this happens to the Na'vi language, I'd be very happy."

1. What do we know about"Avatar" from this passage?

A. The story in it is a moving love story.    

B. It brings the producer $1 billion in total.

C. The story in it happens on an alien planet.

D. It talks about humans and aliens' friendship.

2. The director of "Avatar" James Cameron had a language invented for the Na'vi to    ___  .

A. make the film a whole mystery          

B. make the Na'vi more believable

C. make the Na'vi different from humans    

D. make the film have specific characteristics

3. Who first created the basic words of the Na'vi language?

A. Paul Frommer.        

B. An Indian.    

C. James Cameron    

D. Hamlet.

4. The important feature of the Na'vi language is that       

A. it can be spoken by humans        

B. it has just 30 original words

C. it has a vocabulary of 1000 words.    

D. it is like the Klingon alien language

5. We can infer from the passage that       

A. James Cameron will produce follow-ups to "Avatar"

B. the Na'vi language is another kind of the Klingon language

C. the director believes the Na'vi language will be popular

D. Paul Frommer hopes to add new words to the Na'vi language

答案

1-5: CBCAD

单项选择题
问答题

【说明】函数int Toplogical(LinkedWDigraph G)的功能是对图G中的顶点进行拓扑排序,并返回关键路径的长度。其中图G表示一个具有n个顶点的AOE一网,图中顶点从1~n依次编号,图G的存储结构采用邻接表表示,其数据类型定义如下:
typedef struct Gnode /*邻接表的表结点类型*/
int adivex; /*邻接顶点编号*/
int weight; /*弧上的权值*/
bstmct Gonde*nextare; /*指示下一个弧的结点*/
Gnode;
typedef struct Adjlist /*邻接表的头结点类型*/
char vdata; /*顶点的数据信息*/
struct Gnode*Firstadj; /*指向邻接表的第1个表结点*/
Adjlist;
typedef struct LinkedWDigraph /*图的类型*/
int n, e;/*图中顶点个数和边数*/
struct Adjlist head; /*指向图中第1个顶点的邻接表的头结点*/
LinkedWDigraph;
【函数】
int Toplogical(LinkedWDigraph G)
Gnode *p;
int j,w,top=0;
int *Stack,*ve,*indegree;
ve=(int *)mallloc(G.n+1)* sizeof(int);
indegree=(int *)malloc((G.n+1)*sizeof(int));/*存储网中个顶点的入度*/
Stack=(int *)malloc((G.n+1)*sizeof(int)); /*存储入度为0的顶点的编号*/
if(!ve‖!indegree‖!Stack)
exit(0);
for(j=1;j<=G.n;j++)
ve[j]=0; indegree[j]=0;
/*for*/
for(j=1;j<=G.n;j++) /*求网中各顶点的入度*/
p=G.head[j].Firstadj;
while(p)
(1) ; p=p->nextarc;
/*while*/
/*for*/
for(i=1;j<=G.n;j++)/求网中入度为0的顶点并保存其编号*/
if(!indegree[j]) Stack[++top]=j;
while(top>0)
w= (2) ;
printf("%c", G.head[w].vdata);
p=G.head[w].Firstadj;
while(p)
(3) ;
if(!indegree[p->adjvex])
Stack[++top]=p->adjvex;
if( (4) )
ve[p->adjvex]=ve[w]+p->weight;
p=p->nextarc;
/*while*/
return (5) ;
/*Toplogical*/