栈与队列习题与答案.doc

1. 2001 22A. B. C. D. 2. ,( ),( )n,( ), ( ),( ), : A. B. C. D. : A. n-1 B. n C. n+1 D. n/2: A. B. C. D. : A. .B. .C. .D. ,. 1997 15 1999 153. 123nni1<=i<=n A. B. n-i+1 C. i D. n-i 1999 9(1)4. 1,2,3,nij A. i-j-1 B. i-j C. j-i+1 D. 2000 35. 1,2,3,np1,p2,p3pN,pNnpi( )A. i B. n-i C. n-i+1 D. 2001 11.56. 654321 A. 5 4 3 6 1 2 B. 4 5 3 1 2 6 C. 3 4 6 5 2 1 D. 2 3 4 1 5 6 2001 327. 1234, 200010(2)A. 1243 B. 2134 C. 1432E. 4312 E. 32148. 1 2 3 4 5 A. 2 3 4 1 5 B. 5 4 1 3 2 C. 2 3 1 4 5 D. 1 5 4 3 2 2000 1 2001 4 (1) 2000 229. 12345, A. 5 1 2 3 4 B. 4 5 1 3 2 C. 4 3 1 2 5 D. 3 2 1 5 4 2001 1210. a, bc d, A. acbd B. b, cda C. c, db, a D. d, cab 2000 32 1999 3211. abcdef, Afedcba B. bcafed C. dcefba D. cabdef 1996 9212. XYZ( )AXYZ B. YZX C. ZXY D. ZYX 1997 5213. ABCCBA 1999 8(1)A. push,pop,push,pop,push,pop B. push,push,push,pop,pop,popF. push,push,pop,pop,push,pop D. push,pop,push,push,pop,pop14. V1.ntopn+1x( )Atop:=top+1; V top:=x B. V top:=x; top:=top+1G. top:=top-1; V top:=x D. V top:=x; top:=top-1 1998 13215. V1.mtopii( i =1,2)1v12Vm A. |top2-top1|=0 B. top1+1=top2 C. top1+top2=m D. top1=top2 1999 14116. 1998 32A. B. C. D. A17. 2000 2A. B. C. D.18. i 2000 6 (3)int f(int x) return (x>0) ? x* f(x-1):2);int i ;i =f(f(1);A2 B. 4 C. 8 D. 19. a*(b+c)-d( ) 2001 21.5Aabcd*+- B. abc+*d- C. abc*+d- D. -+*abcd20. 3* 2(4+2*2-6*3)-56 A. 3,2,4,1,1(*(+*- B. 3,2,8(*- C. 3,2,4,2,2(*(- D. 3,2,8(*(- 2000 5221. A B. C. D. 1996 6222. 2001 122A. B. C. D. 23. ,( ) 2001 32A B. H. D. ,24. A B C D. 1998 1225. Am,frontrear 2001 23A(rear-front+m)%m Brear-front+1 C(front-rear+m)%m D(rear-front)%m26. A0.m-1frontrear( ) 2001 51.5A. (rear-front+m)%m B. rear-front+1 C. rear-front-1 D. rear-front27. A0.m 1999 61A. rear=rear+1 B. rear=(rear+1) mod (m-1)I. rear=(rear+1) mod m D. rear=(rear+1)mod(m+1)28. 6rearfront03rearfront( )1999 1(4)A. 1 5 B. 24 C. 42 D. 5129. abcd A. dacb B. cadb C. dbca D. bdac E. 1996 3 (3)30. 1234( ) 1996 52A. 1234 B. 4132 C. 4231 D. 421331. nrearfront A. (rear+1) MOD n=front B. rear=frontCrear+1=front D. (rear-l) MOD n=front 1999 16232. 2001 12A. B. J. D. 33. , , 1,2,3,4 1,2,3,4 1999 15, : A. B. C. D. : A. B.K. D., : A. 3,2,1,4 B. 3,2,4,1 C. 4,2,3,1 D. 4,3,2,1 F. 1,2,3,4 G. 1,3,2,434. 1997 32A B. L. D. 35. SQe1e2e3e4,e5e6SQ6e2e4e3,e6,e5,e1S( )A 6 B. 4 C. 3 D. 2 2000 61.536. 1998 12A B C37. abcdefg, 2000 8Ad ecfbga B. fegdacbM. efdgbca D. cdbefag 1. 1998 22 1998 222. 2000 213. 2000 214 1998 4138. 1999 4239. nCnCn=1/n+1*2n!/(n!)*(n!) 1998 3240. 2001 3 141. 1,2,3,4,5,6,3,2,5,6,4,1. 1995 21 1997 3142. 1999 (5)210123456154623 1999 3143. 19983144. 1998 4145. 1998 3146. 1997 5147. 1998 248. 1996 1149. 2002 2 150. 19975(1)51. 20023(1)52. 1996 21 1999 21 1_ 1997 32_ 1998 3 14. 123_20011(2)5. 1000H()12345PUSH,PUSH,POP,PUSH,POP,PUSH,PUSH_H4 1998 146. stack(1,n)top1top21top1_2 top2_ 1997 136_ 1998 317_(1)_;_(2)_n_(3)_(4)_(5)_ 1994 1553. _ 2001 729SX12341342SX_ 2000 554. data1.ntop,x_ 2001 2 21123+(12*3-2)/4+34*5/7)+108/9_ 1998 4155. _ 2001 1 14/8130NM1M=_PASCALC M= _CPASCAL 2000 714_ 2000 756. _ 2000 2216_ 2001 557. frx_ 2000 3218_2001 2419A1.MFRONTTAIL_ 1995 1158. sq.data0:Msq.front_sq.rear,_ 1997 4 (4)21_ 2000 1022A0.m-1frontrear _ 2000 116%/323Q0.N-1PRQ_ 1997 424 1998 2613/25+61 13, 25/61, +FUNC compute(a):real; a1.mBEGINsetnull(s)i:=1ch:= (1)_WHILE ch<> DOBEGINCASE ch OF0.9: x:=0;WHILE ch<>,DOBEGINx:=x*10+ord(ch)-ord(0);i:=i+1ch:= (2)_;END+: x:=pop(s)+pop(s);-: x:=pop(s);x:=pop(s)-x;*: x:=pop(s)*pop(s);/: x:=pop(s);x:=pop(s)/x;ENDCASEpush(s,x)i:=i+1ch:=aiEND;comput:= (3)_END;59. OPTROPNDprecede(oper1oper2)operate(opnd1,oper,opnd2)# 1999 2 (7)FUNCTION exp_reduced:operandtype;INITSTACK(OPTR);PUSH(OPTR"#")INITSTACK(OPND);read(w)WHILE NOT(w=#) AND (GETTOP(OPTR)=#) DOIF NOT w in op THEN PUSH(OPND,w);ELSE CASE precede(GETTOP(OPTR),w)OF<:(1)_; read(w);=:(2)_; read(w);>:theta:=POP(OPTR);b:=POP(OPND);a:=POP(OPND);(3)_ENDC;RETURN(GETTOP(OPND);ENDF;26_nw1,w2,w3,wnTnTFUNCTION kanp_stack(VAR stack,w:ARRAY1.n OF real; VAR top:integer; T:real):boolean;w1n nTtrue,falseBEGINtop:=0; i:=1; iWHILE (1)_ AND(2)_DOIF (3)_ OR (4)_ AND (i<n)THEN top := (5)_ ;stacktop :=i;iT:=T-wi;IF T=0 THEN RETURN (6)_) ELSE IF (i=n ) AND (top>0)THEN i:=(7)_;top:= (8)_ T:= (9)_ ; Ti:=i+1 ;RETURN(10)_) END; 1996 10 1. 1999 12 1999 322. 1996 6 ( 1 )3. 2001 23 1998 434. SXSXSXSX12 1992 105. 5 ABCDECDCD 2000 16. 1 2 3 4 5 6,:4 3 5 6 1 21 3 5 4 2 6; 1996 3 (3)7. ABCDEBCAEDDBACE 1998 28. a,b,c,d, 2001 429. 2345625346 1996 4210. 1,2,nP1,P2,Pni<j<k,Pj<Pk<Pi 1998 1511. 123456AD1 32564152 1546235 1995 1012. 1 2 3 4 19964(4)13. :FUNCTION vol(n:integer):integer;VAR x :integer:BEGIN IF n=0 THEN vol:=0ELSE BEGIN read(x)vol:=vol(n-1)+xENDENDn4,x5,3,4,2vol? 1998 (10)14. PPP2 1999 4 415. nHanoi 2001 3 516. P(3)PROCEDURE pwinteger;BEGINIF w>0 THENBEGINp(w-1);writeln(w);Wp(w-1ENDEND 2001 717. SMAX/CPASCALpushixi01x 1998 2 (7)18. PROC algo(VAR S : stack; k:integer);VAR T: stack; temp: integer;WHILE NOT empty(S) DOtemp:=POP(S); IF temp<>k THEN PUSH(T,temp);WHILE NOT empty(T) DO temp:=POP(T);PUSH(S,temp); 2002 1419. 8-(3+5)*(5-6/2) 2001 1020. A*B*C(A*(B*C)?(*)19932(6) 19971(8)21. FUNCTION sum (n:integer):intger;BEGINIF n=0 THEN sum:=0ELSE BEGIN read(x)sum:=sum(n-