问题 单项选择题 A3/A4型题

女性,33岁。尿频、尿急、尿痛1天,肉眼血尿2小时就诊,尿常规:WBC200个/HP,RBC150个/HP,尿红细胞畸形率20%。

积极抗感染治疗后,如何判断临床治愈()

A.症状消失

B.尿常规正常

C.症状消失且尿常规正常

D.症状消失且尿常规正常,停药后3天复查尿常规正常

E.症状消失且尿常规正常,停药后7天复查尿常规及尿细菌培养均正常

答案

参考答案:E

阅读理解

阅读理解。

   While my friends attended their universities in great delight,l restarted my senior high school life.

My spirit sank at the thought of staring all over again. Surrounded by strange classmates,l felt like

I was in a maze (迷宫)  and was sorry for myself. There were some complex feelings in my mind.

I was frightened ,nervous and lonely.

     To make matters worse,I recalled my failure again and again, which put more pressure on me

than I could bear. As a result,l was always feeling down during class.

      My teacher found me spiritless. One day he asked me to come to his office and told me about

his attitude towards Iife: we might suffer from making mistakes, but it's important to model ourselves

into the people we will become. All the growing pains and the embarrassing things we may experience

are part of the process. We never stop growing up,so learn from it and keep up your spirit! At last ,

he added , " If you are optimistic , things you want may happen to

you !"

     Warm feelings rushed through my soul. I suddenly found the sun shining again when I stepped out

of his office.

     With the teacher's help,l eventually got over my depression. From then on,l no longer bowed(垂下)

  my head but began smiling to my classmates. I would put up my hand confidently in class and play

with my new friends in my spare time. Meanwhile, I was gradually embraced by my classmates.

     Now faced with fierce competition, we all study strenuously(奋发地) .and every second counts.

However, there is an atmosphere of mutuai(相互的)  trust and respect between us. I love my class;

  I love my classmates !

      To  be frank ,I still have a thirst for my dream university , but I'm not afraid of the failure because

I can profit by it. With parents and teachers' great expectation, I'm quite certain of my future and I'm

sure I can fly high.

1. Why did the teacher have a talk with the author?   

A. He found the author in a bad mood.

B. He thought the author very talkative.

C. It was his duty to talk to a new student.

D. The author impressed the teacher favorably.

2. What can we leam about the teacher from Paragraph 3?   

A. He has once made some mistakes in his life.

B. He is very optimistic about his future success.

C. He instructs the author to develop a positive attitude.

D. He thinks one can't grow up without bad experiences.

3. The underlined word " embraced"  in Paragraph 5 can be replaced by__________.

A. hugged                

B. accepted

C. understood            

D. recognized

4. How can you describe the author's feeling from the last two paragraphs ? 

A. Depressed.            

B. Pessimistic.

C. Satisfied.              

D. Confident.

5. The moral lesson we learn from author's story is that________.    

A. challenges we face benefit us

B. it is hard to get over difficulty

C. mutual understanding is critical

D. it is teachers who save our lives

问答题

试题四 (共15 分 )  阅读下列说明,回答问题1和问题2,将解答填入答题纸的对应栏内。  【说明】  现需在某城市中选择一个社区建一个大型超市,使该城市的其它社区到该超市的距离总和最小。用图模型表示该城市的地图,其中顶点表示社区,边表示社区间的路线,边上的权重表示该路线的长度。  现设计一个算法来找到该大型超市的最佳位置:即在给定图中选择一个顶点,使该顶点到其它各顶点的最短路径之和最小。算法首先需要求出每个顶点到其它任一顶点的最短路径,即需要计算任意两个顶点之间的最短路径;然后对每个顶点,计算其它各顶点到该顶点的最短路径之和;最后,选择最短路径之和最小的顶点作为建大型超市的最佳位置。

【问题 1】(12 分)  本题采用Floyd-Warshall算法求解任意两个顶点之间的最短路径。 已知图G的顶点集合为V= {1,2,...,n } ,W= {Wij}n*n 为权重矩阵。设 d (k)ij=为从顶点i到顶点j的一条最短路径的权重。当k = 0时,不存在中间顶点,因此d(0)ij=wij  当k >0 时,该最短路径上所有的中间顶点均属于集合 {1,2, ..., k}若中间顶点包括顶点 k ,则d(k)ij=d(k-1)ik+d(k-1)kj若中间顶点不包括顶点k ,则d(k-1)ij=d(k-1)ij  于是得到如下递归式。

  因为对于任意路径,所有的中间顶点都在集合{1,2, ..., n} 内,因此矩阵D(n) ={d(n)ij}n*n 给出了任意两个顶点之间的最短路径,即对所有i, j ∈V,d(n)ij表示顶点i到顶点 j的最短路径。   下面是求解该问题的伪代码,请填充其中空缺的 (1)至(6)处。 伪代码中的主要变量说明如下:  W:权重矩阵  n: 图的顶点个数  SP:最短路径权重之和数组,SP[i]表示顶点i到其它各顶点的最短路径权重之和,i从1到n  min_SP:最小的最短路径权重之和  min_v:具有最小的最短路径权重之和的顶点  i:循环控制变量  j:循环控制变量  k:循环控制变量  LOCATE -SHOPPINGMALL(W, n)  1D(0)=W  2for (1)   3for i = 1 to n  4for j = 1 to n  5 if d(k-1)ij≤≤d(k-1)ik+d(k-1)kj  6 (2)   7 else  8 (3)   9for i = 1 to n  10SP[i] = 0  11for j = 1 to n  12 (4)   13min_SP = SP[1]  14 (5)   15for i = 2 to n  16 if min_SP > SP[i]  17 min_SP = SP[i]  18 min_v = i  19 return (6)