計算機考研數(shù)據(jù)結(jié)構(gòu)統(tǒng)考?xì)v年真題2009-20156814

2009-2015

2016

2009

1.

A.

B.

C.

D.

2.S

Q

abcdefg

S

Q7

bdcfeag

S

A1B.2C.3D.4

N

3175624

ALRNB.NRLC.RLND.RNL

3.

4.

L

R

5.

6

1

8

u

A39B.52C.111D.119

6.

v

uv

I

II.

III.u

v

A.IIB.IIIC.IIIID.IIIIII

7.

I

II.

1III.

1

A.IB.IIC.IIID.IIII

8.

A

C

9.

mB

m

B.

D.

58121928201522

3

A351282820152219

B.351219201522828

C381252015222819

D.312582820152219

10.

1112137892345

A

B.

C.

D.

41.10

u

u

v

u=v

u

42.15

data

link

list

k

k

data

1

0

1

2

3

CC++

JAVA

2010

1

a,b,c,d,e,f

AdcebfaBcbdaefCdbcaefDafedcb

2

AbacdeBdbaceCdbcaeDecbad

3

4

48

37

A1348B2448C2453D2490

5

4

T

20

4

10

3

1

2

10

1

T

A41B82C113D122

6n(n

2)

A

B

C

D

7

1

G-V.E

7

G

A6B15C16D21

8

e

d

a

c

b

A4B3C2D1

9

16

L

A4B5C6D7

10

A

B

C

D

11

2121688510

2121651088

2125101688

2510121688

A

B

C

D

41.10

781118914

0

Hkey=

0.7

key3MODT

1

2

42.13

n(n,1)

R

R

P0Pn

XpXp+1Xn-1X0X1Xp-1

R

1

2

3

X0X1Xn-1

CC++JAVA

2011

1.n

x=2;

while(x<n/2)

x=2*x;

A.O(log2n)B.O(n)C.O(nlog2n)D.O(n2)

a,b,c,d,e

2.

3.

d

A.3B.4C.5D.6

A[0..n-1]

frontrear

1

A[0]

frontrear

A.0,0B.0,n-1C.n-1,0D.n-1,n-1

4.

768

A.257B.258C.384D.385

5.

1,2,3,44,3,

2,1

A.1,2,3,4B.2,3,4,1C.3,2,4,1D.4,3,2,1

6.

2011

116

A.115B.116C.1895D.1896

7.

A.95,22,91,24,94,71B.92,20,91,34,88,35

C.21,89,77,29,36,38D.12,25,71,68,33,34

8.

I.

II.

III.

A.IIB.

IIIC.

IIID.

IIII

9.

I.

II.

(Hash)

()

()

III.

A.IB.IIC.

10.

()

()

IIIII

IIID.

C.

A.

B.

D.

11.

25,13,10,12,9

18

A.1B.2C.4D.5

41.(8)

6

(

0~5)

G

A

(

)

(1)

(2)

G

A

G

(3)

G

42.(15)

L(L1)

S

L/2

S1

S

S1=(11,13,15,17,19)

15

S2=(2,4,

AB

AB

6,8,20)

S1S2

11

:(1)

(2)

(3)

CC++JAVA

2012

1

n(n0)

()

intfact(intn)

{if(n<=1)return1;

returnn*fact(n-1);

}

A.O(log2n)B.O(n)C.(nlog2n)

D.O(n2)

2

+-*/(

)

a+b-a*((c+d)/e-f)+g

ab+acd+e/f-**-g+

()

A.5B.7C.8D.11

3

a,e,b,d,c

b,c,d,e,a

()

A.eB.ebC.ecD.

4

6

1

()

A.10B.20C.32D.33

5

n

e

()

A.O(n)B.O(e)C.O(n+e)D.O(n*e)

6

()

A.

C.

7

B.

D.

Dijkstra

a

b

c

()

A.d,e,f

8

B.e,d,f

C.f,d,e

D.f,e,d

()

Prim

C.

Kruskal

A.

9

B.

D.

3B-

78

B-

()

A.60B.60,62C.62,65D.65

10

()

.

.

.

.

.

A.

C.

B.

D.

11

()

A.

C.

B.

D.

4110

5060200

6

6

ABCDEF

103540

5

1

1

2

N(N2)

4213

loaging

being

str1str2

data,next

str1str2

p

i

1

2

3

CC++java

2013

1.

mn

m+n

A.O(n)B.O(m*n)C.O(min(m,n))D.O(max(m,n))

1,2,3,,np1,p2,p3,pnp2=3

2.

p3

:

A.n-3B.n-2C.n-1D.

3.

1234567

0

T

T

A.0B.1C.2D.3

4.T6

234567T

A.27B.46C.54

5.X

D.56

X

Y

X

A.X

C.X

6.

B.Y

D.Y

T1

Y

v

T2

v

T2

T3

T1T3

I.vT1

II.vT1

III.v

T1T3

T1T3

T1T3

T1T3

T1

T1

IV.v

A.IIIIB.IIVC.IIIIID.IIIV

7.

A

A.1212B.2211C.3423D.4422

8.

A.hcabdegfB.eafgbhcd

C.dbcahefgD.abcdhefg

9

AOE

8

AceBdeCfdDfh

10

25B

A5B7C8

D14

A=(05535755)5

A=(055351

57)A

A

n

A

-1

1

2

CC++Java

3

42.10

4

S={"do""for""repeat""while"}

p1=0.35p2=0.15p3=0.15p4=0.35S

4

2.2

1

S

2

S

2014

1.

count=0;

for(k=1;k<=n;k*=2)

for(j=1;j<=n;j+1)

count++;

A.O(log2n)

B.O(n)

B.

C.O(nlog2n)

D.O(n)

2

abcdefg

2.

f

A

C.

D.

3.

A[0M-1]end1

end2

M-1

A.

B.

C.

D.

4.

end1==end2

end1==end2;

end1==(end2+1)modM

end2==(end1+1)mod(M-1)

end2==(end1+1)modM;

end1==end2+1modM;

end1==end2+1modM

end2==(end1+1)mod(M-1)

x

A.e,c

B.e,a

C.d,c

D.b,a

a

b

c

d

x

e

5.

F

TF

A.T

C.T

6.5

B.T

1

D.T

4

A.01,0000,0001,001,1

C.000,001,010,011,100

7.

B.011,000,001,010,1

D.000,001,010,011,100

A.3,1,2,4,5,6

B.3,1,2,4,6,5

C.3,1,4,2,5,6

D.3,1,4,2,6,5

1

2

4

5

3

6

8.

A.

B.

D.

C.

9.

15

4B

A.5

10.

B.6

C.10

D.15

C.4

1

9,1,4,13,7,8,20,23,15

A.2

B.3

D.5

11.

2

A.2,3,5,4,6,7,9

C.3,2,5,4,7,6,9

41.13

B.2,7,5,6,4,3,9

D.4,2,3,5,7,6,9

WPL

T

left

weight

right

weight

root

T

TWPL

1

2

3

CC++

CC++

2015

1

ints(intn){return(n<=0)?0:s(n-1)+n;}

voidmain(){cout<<s(1);}

Amain()->S(1)->S(0)BS(0)->S(1)->main()

Cmain()->S(0)->S(1)DS(1)->S(0)->main()

2

a,b,c,d

A13B14C15D16

3

A2410524107B2410524127

C241010241411D2410524146

4

AVL

,

A

2B

C

D

5

G=(V,E)

V={V0,V1,V2,V3}

E={<v0,v1>,<v0,v2>,<v0,v3

><v1,v3>},

V0

A2B3