数据结构与程序设计4.htm

Data Structure Question

            <p class=MsoNormal><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>设文件</span><span
lang=EN-US>P.PAS</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>中存有一语法正确的</span><span
lang=EN-US>PASCAL</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>源程序，其中字母均为小写。请写一程序，输出</span><span
lang=EN-US>P.PAS</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>中第一个保留字</span><span
lang=EN-US>begin</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>所在行。</span></p>
            <p class=MsoNormal><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>提示：设</span><span
lang=EN-US>OPEN</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>语句格式为</span></p>
            <p class=MsoNormal><span lang=EN-US><span style='mso-tab-count:1'>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
              </span>OPEN</span><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>（</span><span
lang=EN-US>&lt;</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>文件变量</span><span
lang=EN-US>&gt;</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>，</span><span
lang=EN-US>&lt;</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>文件名</span><span
lang=EN-US>&gt;</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>）</span></p>
            <p class=MsoNormal><b><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>三（共</span><span
lang=EN-US>30</span></b><b><span style='font-family:宋体;mso-ascii-font-family:
"Times New Roman"'>分，每题</span><span lang=EN-US>6</span></b><b><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>分）</span><span
lang=EN-US><o:p></o:p></span></b></p>
            <p class=MsoNormal style='margin-left:18.0pt;text-indent:-18.0pt;mso-list:l1 level1 lfo2;
tab-stops:list 18.0pt'><![if !supportLists]><span lang=EN-US>1、<span
style='font:7.0pt "Times New Roman"'>&nbsp; </span></span><![endif]><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>已知一棵四次树，其结点数据场之值为一英文大写字母。现给出该二叉树的前序周游结构（按前序打印数据场之值）及每个结点的次数如下：</span></p>
            <p class=MsoNormal style='text-indent:18.0pt'><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>前序：</span><span lang=EN-US>A,B,C,F,G,D,H,J,K,M,N,E,I</span></p>
            <p class=MsoNormal style='text-indent:18.0pt'><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>次数：</span><span lang=EN-US>4,0,2,0,0,1,1,3,0,0,1,0,1,0</span></p>
            <p class=MsoNormal style='text-indent:18.0pt'><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>试画一图形表示该四次树。</span></p>
            <p class=MsoNormal style='margin-left:18.0pt;text-indent:-18.0pt;mso-list:l1 level1 lfo2;
tab-stops:list 18.0pt'><![if !supportLists]><span lang=EN-US>2、<span
style='font:7.0pt "Times New Roman"'>&nbsp; </span></span><![endif]><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>有人说：“队列和栈都是优先队列的特殊情况”，这句话对吗？如果不对，请说明理由。如果正确，回答为什么并给出如果用优先队列实现栈和队列的方法。</span></p>
            <p class=MsoNormal style='margin-left:18.0pt;text-indent:-18.0pt;mso-list:l1 level1 lfo2;
tab-stops:list 18.0pt'><![if !supportLists]><span lang=EN-US>3、<span
style='font:7.0pt "Times New Roman"'>&nbsp; </span></span><![endif]><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>已知如图所示的有向图，试求出：</span></p>
            <p class=MsoNormal style='margin-left:18.0pt'><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>每个结点的最早完成时间</span><span lang=EN-US>TE</span><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>值及最晚完成时间</span><span
lang=EN-US>TL</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>值。</span></p>
            <p class=MsoNormal style='margin-left:18.0pt'><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>求出关键活动及关键路径。</span></p>
            <p class=MsoNormal><span lang=EN-US><!--[if gte vml 1]><v:shapetype id="_x0000_t75"
 coordsize="21600,21600" o:spt="75" o:preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe"
 filled="f" stroked="f">
 <v:stroke joinstyle="miter"/>
 <v:formulas>
  <v:f eqn="if lineDrawn pixelLineWidth 0"/>
  <v:f eqn="sum @0 1 0"/>
  <v:f eqn="sum 0 0 @1"/>
  <v:f eqn="prod @2 1 2"/>
  <v:f eqn="prod @3 21600 pixelWidth"/>
  <v:f eqn="prod @3 21600 pixelHeight"/>
  <v:f eqn="sum @0 0 1"/>
  <v:f eqn="prod @6 1 2"/>
  <v:f eqn="prod @7 21600 pixelWidth"/>
  <v:f eqn="sum @8 21600 0"/>
  <v:f eqn="prod @7 21600 pixelHeight"/>
  <v:f eqn="sum @10 21600 0"/>
 </v:formulas>
 <v:path o:extrusionok="f" gradientshapeok="t" o:connecttype="rect"/>
 <o:lock v:ext="edit" aspectratio="t"/>
</v:shapetype><v:shape id="_x0000_i1025" type="#_x0000_t75" style='width:180pt;
 height:114.75pt'>
 <v:imagedata src="./上海交通大学数据结构1989.files/image001.gif" o:title="1"/>
</v:shape><![endif]--><![if !vml]><img width=240 height=153
src="../school/image001.gif" v:shapes="_x0000_i1025"><![endif]></span></p>
            <p class=MsoNormal><span lang=EN-US>4</span><span style='font-family:宋体;
mso-ascii-font-family:"Times New Roman"'>、采用多阶段合并分类法合并若干条磁带上的文件为一有序文件，当最初合并段不是标准</span><span
lang=EN-US>fibonacci</span><span style='font-family:宋体;mso-ascii-font-family:
"Times New Roman"'>数时。可以补充适当的空段。试问，补充的空段在各条磁带上应如何分布？为什么？</span></p>
            <p class=MsoNormal style='margin-left:18.0pt;text-indent:-18.0pt;mso-list:l0 level1 lfo4;
tab-stops:list 18.0pt'><![if !supportLists]><span lang=EN-US>5、<span
style='font:7.0pt "Times New Roman"'>&nbsp; </span></span><![endif]><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>有一棵完全二叉树，其叶子结点分布在最下面二层上。设叶子结点个数为</span><span
lang=EN-US>L</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>，请问该二叉树由根至所有叶子结点的路径长度之和为多少？给出证明。</span></p>
            <p class=MsoNormal><b><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>四（</span><span
lang=EN-US>15</span></b><b><span style='font-family:宋体;mso-ascii-font-family:
"Times New Roman"'>分）</span><span lang=EN-US><o:p></o:p></span></b></p>
            <p class=MsoNormal><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>已知一棵分类二叉树，其结点数据之值为一正整数。现给定一个正整数，设计一个完整的过程删除设计之值为该正整数的结点并仍保持分类二叉树的特性不变。</span></p>
            <p class=MsoNormal><b><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>五（</span><span
lang=EN-US>15</span></b><b><span style='font-family:宋体;mso-ascii-font-family:
"Times New Roman"'>分）</span><span lang=EN-US><o:p></o:p></span></b></p>
            <p class=MsoNormal><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>以数偶形式给出一个无向图的所有的边并设该无向图的顶点的数据之值为一正整数。比如，输入数偶</span><span
lang=EN-US>&lt;1,2&gt;</span><span style='font-family:宋体;mso-ascii-font-family:
"Times New Roman"'>表示数据之值为</span><span lang=EN-US>1</span><span
style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>及</span><span
lang=EN-US>2</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>的两个结点之间有一条无向边。设计一个过程，要求实现：</span><span
lang=EN-US>1</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>、以邻接多重表的形式存贮该无向图。</span><span
lang=EN-US>2</span><span style='font-family:宋体;mso-ascii-font-family:"Times New Roman"'>、对该图进行深度为主的遍历（打印结点数据场之值）。<br><br><br>※来源：<a href="http://edu.yesky.com/jinxiu/kaoyan">天极网考研 http://edu.yesky.com/jinxiu/kaoyan</font></a></p><p align=right>-<a href="javascript:window.close()"><font color="#000000">关闭窗口</font></a>-<font color="#ffffff">.....</font></p><br><br><DIV align=center><IFRAME frameBorder=0 height=60 marginHeight=0 marginWidth=0 scrolling=no src="../../ad2.htm" width=468 bordercolor="#000000"></IFRAME></DIV><br></td>
  </tr>
</table>
</center></div>
<div align=center><table width=100%><tr bgcolor=blue><td></td></tr><td class=unnamed1 width=1%></td><tr><td width=100%><p align=center><code><span style=font-size:9pt>&copy; 2000 雅舍资讯 版权所有 转载请注明出处<br>All rights reserved</span></code></td></tr></table></div>
<div id="Layer01" style="position:absolute; left:14px; top:85px; width:100px; height:15px; z-index:5; background-color: #FFFFFF; layer-background-color: #FFFFFF; border: 1px none #FFFFFF;><font color="red"><font color=blue>当前在线</font></font><script
src="http://61.139.59.105/mssoft/online/online.asp?id=yasee"></script><font color=blue>人</DIV></body>
</html>