📄 st03.htm
字号:
style='mso-spacerun:yes'> </span>D. </span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>两个栈均不空<span lang=EN-US>,</span>且一个栈的栈顶到达另一个栈的栈底<span
lang=EN-US>.<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【上海海运学院 <span lang=EN-US>1997 </span>二、<span
lang=EN-US>1</span>（<span lang=EN-US>5</span>分）】【上海海运学院 <span lang=EN-US>1999 </span>二、<span
lang=EN-US>1</span>（<span lang=EN-US>5</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>3. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>一个栈的输入序列为<span lang=EN-US>123…n</span>，若输出序列的第一个元素是<span lang=EN-US>n</span>，输出第<span
lang=EN-US>i</span>（<span lang=EN-US>1<=i<=n</span>）个元素是（<span
lang=EN-US><span style='mso-spacerun:yes'> </span></span>）。<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A. </span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>不确定<span lang=EN-US><span
style='mso-spacerun:yes'>
</span>B. n-i+1<span
style='mso-spacerun:yes'>
</span>C. <span style='mso-spacerun:yes'> </span>i<span
style='mso-spacerun:yes'>
</span>D. n-i<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【中山大学 <span lang=EN-US>1999 </span>一、<span
lang=EN-US>9(1</span>分<span lang=EN-US>)</span>】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>4. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>若一个栈的输入序列为<span lang=EN-US>1,2,3,…,n</span>，输出序列的第一个元素是<span lang=EN-US>i</span>，则第<span
lang=EN-US>j</span>个输出元素是（<span lang=EN-US><span
style='mso-spacerun:yes'> </span></span>）。<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:17.1pt;mso-char-indent-count:1.5'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'><span
style='mso-spacerun:yes'> </span>A. i-j-1<span
style='mso-spacerun:yes'>
</span>B. i-j<span
style='mso-spacerun:yes'>
</span>C. j-i+1<span style='mso-spacerun:yes'>
</span>D. </span><span style='mso-bidi-font-size:10.5pt;font-family:宋体'>不确定的<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【武汉大学 <span lang=EN-US>2000 </span></span><!--[if supportFields]><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'><span
style='mso-element:field-begin'></span><span
style='mso-spacerun:yes'> </span>= 2 \* CHINESENUM3 <span
style='mso-element:field-separator'></span></span><![endif]--><span
style='mso-bidi-font-size:10.5pt;font-family:宋体;mso-no-proof:yes'>二</span><!--[if supportFields]><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'><span
style='mso-element:field-end'></span></span><![endif]--><span style='mso-bidi-font-size:
10.5pt;font-family:宋体'>、<span lang=EN-US>3</span>】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>5. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>若已知一个栈的入栈序列是<span lang=EN-US>1,2,3<span style='color:red'>,</span>…,n</span>，其输出序列为<span
lang=EN-US>p<sub>1</sub>,p<sub>2</sub>,p<sub>3</sub></span>，<span lang=EN-US>…</span>，<span
lang=EN-US>p<sub>N</sub>,</span>若<span lang=EN-US>p<sub>N</sub></span>是<span
lang=EN-US>n</span>，则<span lang=EN-US>p<sub>i</sub></span>是<span lang=EN-US>(<span
style='mso-spacerun:yes'> </span>)</span>。<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'><span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>A. i<sub><span
style='mso-spacerun:yes'> </span></sub><span
style='mso-spacerun:yes'> </span>B.
n-i<span style='mso-spacerun:yes'>
</span>C. n-i+1<span
style='mso-spacerun:yes'> </span>D. </span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>不确定<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【南京理工大学 <span lang=EN-US>2001 </span>一、<span
lang=EN-US>1</span>（<span lang=EN-US>1.5</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>6. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>有六个元素<span lang=EN-US>6</span>，<span lang=EN-US>5</span>，<span lang=EN-US>4</span>，<span
lang=EN-US>3</span>，<span lang=EN-US>2</span>，<span lang=EN-US>1 </span>的顺序进栈，问下列哪一个不是合法的出栈序列？（<span
lang=EN-US><span style='mso-spacerun:yes'> </span></span>）<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A. 5 4 3 6 1 2<span
style='mso-spacerun:yes'> </span>B. 4 5 3 1 2 6<span
style='mso-spacerun:yes'> </span>C. 3 4 6 5 2 1<span
style='mso-spacerun:yes'> </span>D. 2 3 4 1 5 6 <o:p></o:p></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【北方交通大学 <span lang=EN-US>2001 </span>一、<span
lang=EN-US>3</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>7. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>设栈的输入序列是<span lang=EN-US>1</span>，<span lang=EN-US>2</span>，<span
lang=EN-US>3</span>，<span lang=EN-US>4<span style='color:red'>,</span></span>则（<span
lang=EN-US><span style='mso-spacerun:yes'> </span></span>）不可能是其出栈序列。【<span
style='color:black'>中科院计算所<span lang=EN-US>2000</span>一、<span lang=EN-US>10(2</span>分<span
lang=EN-US>)</span></span>】<span lang=EN-US style='mso-bidi-font-weight:bold'><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A. 1</span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>，<span lang=EN-US>2</span>，<span
lang=EN-US>4</span>，<span lang=EN-US>3</span>，<span lang=EN-US><span
style='mso-spacerun:yes'> </span>B. 2</span>，<span
lang=EN-US>1</span>，<span lang=EN-US>3</span>，<span lang=EN-US>4</span>，<span
lang=EN-US><span
style='mso-spacerun:yes'> </span>C. 1</span>，<span
lang=EN-US>4</span>，<span lang=EN-US>3</span>，<span lang=EN-US>2</span>，<span
lang=EN-US> <o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>D. 4</span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>，<span lang=EN-US>3</span>，<span
lang=EN-US>1</span>，<span lang=EN-US>2</span>，<span lang=EN-US><span
style='mso-spacerun:yes'> </span>E. 3</span>，<span
lang=EN-US>2</span>，<span lang=EN-US>1</span>，<span lang=EN-US>4</span>，<span
lang=EN-US style='mso-bidi-font-weight:bold'><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>8. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>一个栈的输入序列为<span lang=EN-US>1 2 3 4 5</span>，则下列序列中不可能是栈的输出序列的是（<span
lang=EN-US><span style='mso-spacerun:yes'> </span></span>）。<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'><span style='mso-spacerun:yes'> </span>A. 2 3 4 1
5<span style='mso-spacerun:yes'> </span>B. 5 4 1 3
2<span style='mso-spacerun:yes'> </span>C. 2 3 1 4
5<span style='mso-spacerun:yes'> </span>D. 1 5 4
3 2<o:p></o:p></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【南开大学 <span lang=EN-US>2000 </span></span><!--[if supportFields]><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'><span
style='mso-element:field-begin'></span><span
style='mso-spacerun:yes'> </span>= 1 \* CHINESENUM3 <span
style='mso-element:field-separator'></span></span><![endif]--><span
style='mso-bidi-font-size:10.5pt;font-family:宋体;mso-no-proof:yes'>一</span><!--[if supportFields]><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'><span
style='mso-element:field-end'></span></span><![endif]--><span style='mso-bidi-font-size:
10.5pt;font-family:宋体'>、<span lang=EN-US>1</span>】【山东大学 <span lang=EN-US>2001 </span>二、<span
lang=EN-US>4 (1</span>分<span lang=EN-US>)</span>】【北京理工大学 <span lang=EN-US>2000 </span>一、<span
lang=EN-US>2</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>9. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>设一个栈的输入序列是<span lang=EN-US> 1</span>，<span lang=EN-US>2</span>，<span
lang=EN-US>3</span>，<span lang=EN-US>4</span>，<span lang=EN-US>5<span
style='color:red'>,</span></span>则下列序列中，是栈的合法输出序列的是（<span lang=EN-US><span
style='mso-spacerun:yes'> </span></span>）。<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A. 5 1 2 3 4<span
style='mso-spacerun:yes'> </span>B. 4
5 1 3 2<span style='mso-spacerun:yes'> </span>C.
4 3 1 2 5<span
style='mso-spacerun:yes'> </span>D. 3
2 1 5 4<o:p></o:p></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【合肥工业大学 <span lang=EN-US>2001 </span>一、<span
lang=EN-US>1</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>10. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>某堆栈的输入序列为<span lang=EN-US>a, b</span>，<span lang=EN-US>c </span>，<span
lang=EN-US>d,</span>下面的四个序列中，不可能是它的输出序列的是（<span lang=EN-US><span
style='mso-spacerun:yes'> </span></span>）。<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'><span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>A. a</span><span style='mso-bidi-font-size:
10.5pt;font-family:宋体'>，<span lang=EN-US>c</span>，<span lang=EN-US>b</span>，<span
lang=EN-US>d<span
style='mso-spacerun:yes'>
</span>B. b, c</span>，<span lang=EN-US>d</span>，<span lang=EN-US>a<span
style='mso-spacerun:yes'> </span>C. c, d</span>，<span
lang=EN-US>b, a<span
style='mso-spacerun:yes'>
</span>D. d, c</span>，<span lang=EN-US>a</span>，<span lang=EN-US>b<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【北京航空航天大学 <span lang=EN-US>2000
</span>一、<span lang=EN-US>3</span>（<span lang=EN-US>2</span>分）】【北京邮电大学 <span
lang=EN-US>1999 </span>一、<span lang=EN-US>3</span>（<span lang=EN-US>2</span>分）】<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>11. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>设<span lang=EN-US>abcdef</span>以所给的次序进栈，若在进栈操作时，允许退栈操作<span lang=EN-US>,</span>则下面得不到的序列为
（<span lang=EN-US><span style='mso-spacerun:yes'> </span></span>）。<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A</span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>．<span lang=EN-US>fedcba <span
style='mso-spacerun:yes'> </span>B. bcafed <span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>C. dcefba<span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>D. cabdef<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【南京理工大学 <span lang=EN-US>1996 </span>一、<span
lang=EN-US>9</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>12. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>设有三个元素<span lang=EN-US>X</span>，<span lang=EN-US>Y</span>，<span lang=EN-US
style='color:red'>Z</span><span style='color:red'>顺</span>序进栈（进的过程中允许出栈），下列得不到的出栈排列是<span
lang=EN-US>(<span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>)</span>。<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A</span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>．<span lang=EN-US>XYZ<span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>B.
YZX<span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>C.
ZXY<span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>D. ZYX<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【南京理工大学 <span lang=EN-US>1997 </span>一、<span
lang=EN-US>5</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>13. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>输入序列为<span lang=EN-US>ABC</span>，可以变为<span lang=EN-US>CBA</span>时，经过的栈操作为（<span
lang=EN-US><span style='mso-spacerun:yes'> </span></span>）【中山大学<span
lang=EN-US> 1999 </span>一、<span lang=EN-US>8(1</span>分<span lang=EN-US>)</span>】<span
lang=EN-US><o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A. push,pop,push,pop,push,pop<span
style='mso-spacerun:yes'> </span>B.
push,push,push,pop,pop,pop<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'><span style='mso-spacerun:yes'> </span>C.
push,push,pop,pop,push,pop<span
style='mso-spacerun:yes'> </span>D.
push,pop,push,push,pop,pop<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>14. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>若一个栈以向量<span lang=EN-US>V[1..n]</span>存储，初始栈顶指针<span lang=EN-US>top</span>为<span
lang=EN-US>n+1</span>，则下面<span lang=EN-US>x</span>进栈的正确<span style='mso-bidi-font-weight:
bold'>操作是<span lang=EN-US>( <span
style='mso-spacerun:yes'> </span>)</span>。<span lang=EN-US><o:p></o:p></span></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'>A</span><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>．<span lang=EN-US
style='mso-bidi-font-weight:bold'>top:=top+1; <span
style='mso-spacerun:yes'> </span>V</span><span lang=EN-US> [<span
style='mso-bidi-font-weight:bold'>top</span>]<span style='mso-bidi-font-weight:
bold'>:=x<span style='mso-spacerun:yes'>
</span><span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>B.<span
style='mso-spacerun:yes'> </span>V</span> [<span style='mso-bidi-font-weight:
bold'>top</span>]<span style='mso-bidi-font-weight:bold'>:=x; top:=top+1<span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span><o:p></o:p></span></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体;mso-bidi-font-weight:
bold'>C. top:=top-1; <span style='mso-spacerun:yes'> </span>V</span><span
lang=EN-US style='mso-bidi-font-size:10.5pt;font-family:宋体'> [<span
style='mso-bidi-font-weight:bold'>top</span>]<span style='mso-bidi-font-weight:
bold'>:=x<span style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span><span
style='mso-spacerun:yes'> </span>D. <span
style='mso-spacerun:yes'> </span>V</span> [<span style='mso-bidi-font-weight:
bold'>top</span>]<span style='mso-bidi-font-weight:bold'>:=x; top:=top-1<o:p></o:p></span></span></p>
<p class=MsoNormal style='text-indent:22.8pt;mso-char-indent-count:2.0'><span
style='mso-bidi-font-size:10.5pt;font-family:宋体'>【南京理工大学 <span lang=EN-US>1998 </span>一、<span
lang=EN-US>13</span>（<span lang=EN-US>2</span>分）】<span lang=EN-US
style='mso-bidi-font-weight:bold'><o:p></o:p></span></span></p>
<p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt;
font-family:宋体'>15. </span><span style='mso-bidi-font-size:10.5pt;font-family:
宋体'>若栈采用顺序存储方式存储，现两栈共享空间<span lang=EN-US>V[1..m]</span>，<span lang=EN-US>top[i]</span>代表第<span
lang=EN-US>i</span>个栈<span lang=EN-US>( i =1,2)</span>栈顶，栈<span lang=EN-US>1</span>的底在<span
lang=EN-US>v[1]</span>，栈<span lang=EN-US>2</span>的底在<span lang=EN-US>V[m]</span>，则栈满⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -