2012年计算机考研模拟试题

2012年计算机考研计算机考研模拟试题考研模拟试题

A[m][ n]A[0][0] 1.

78010)A[4][6]

A[6][20] (10)10 1146(10)

A. 692(10) B. 780(10) C. 1146(10) D. 1340(10)

S1, 2, 3, ..., n 2.

p1, p2, p3, ..., pnp3 = 1p1 A. 2 B. 3 C. 4 D. 5

DQ1, 2, 3, , n 3.

A. n B. n(n-1)/2 C. D. n!

{38, 42, 55, 15, 23, 44, 30, 74, 48, 26}4.

2

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

5.

A.

B.

C.

D.

6.

xy+z+ == xyz++ xy+z- == xyz-+ xy-z+ == xyz+- xy-z- == xyz--

C. D. A. B.

G = (V, E) V={V0,V1,V2,V3} E ={(V0,V1), (V0,V2), (V0,V3), (V1,V3)} 7.

V0 G

A. 3 B. 4 C. 5 D. 2 8. 3 4 4 A. 32 B. 40 C. 102 D. 176

200 9.

2.5

Sn = (1/)loge(1/(1-)), Un = 1/(1-),

A. 333 B. 400 C. 401 D. 409 10.

B. C. D. A.

11.

B C D A

12. CPU

B C D A

13.

A B C D

S 21S 14. PV

A0 B1 C2 D3

15. A16. AC17.

B

C

D

B D

A

18.

B

C

D

FAT

B

FAT D A

19.

Adevice controller BDMA Chard disk drive Ddevice driver 20.

B C D A

21. 5 B 67 5 B

FCB C

B

LinkNode 22.

struct LinkNode { int data; int freq; struct LinkNode *link; };

data freq 0

freq

data

freq 1

freq

freq

32 1623.

16 1 11900 3FF 2 11D00 1FF 3 0 0 4 11F00 1000 5 0 0 6 0 0 7 13000 FFF

main sin 240 push x[10108] 360 mov 4(sp), r2 244 call sin 364 push r2 248 ... 366 ... 488 ret

5 B 51 5

:

link

Search

16

1x 23

4push x 5call sin

10108

70FF0

SP

4

x

PC

x

PC

PC

PC

6"mov 4(sp), r2"

1. 90

D

Loc(4, 6) = Loc(0, 0)+(4*n+6)*1 = 780+(4*n+6) = 1146n = (1146-780-6)/4 =

Loc(6, 20) = Loc(0, 0)+(6*90+20)*1 = 780+560 = 1340

p3 = 11, 2, 3 2. B

= 3

n = 31, 2, 3: 3. D

3, 2, 1

p1

1, 2, 33, 2, 11, 3, 23, 1, 2 2, 1, 32, 3, 1

4.

5.

xy+z+ == xyz++6. C

xy+z- == xyz-+

(x+y)-z == x+(y-z)

(x-y)+z == x-(y+z)

CB

2

3!4

(x+y)+z == x+(y+z)

xy-z+ == xyz+-xy-z- == xyz--

(x-y)-z == x-(y-z)

7.

B

4

8. C

9. D1/2.5 = 2/53/5

V0V1V3V2V0V2V1V3V0V2V3V1V0V3V1V2

Un = 1/(1-)n = 200

Un

2.5

1/(1-)2.5

1-

0.5

n/m =

0.5

mn/0.5 = 2n = 400

m

4k+3

400

401

4k+3

m = 409

10.

C

n-1

n-1

n(n-1)/2

n*d

d

11. C 12. C 13. A 14. B 15. B 16. B 17. C

18. A 19. D 20. B

2

21

67

5

B

5

5

B B

4

5/2-1 = 2

51

5

B

22

3 value

*p

n

n(n-1)/2

ppre

p->dataq *p

q

p

*p

pre freq

i1in

*p

*p

bool selfOrganizationList(LinkNode *f, int value, LinkNode *& p );

. LinkNode *pre, *q; p = q = f->link; pre = f;

while (p != NULL && p->data != value) { if (pre != f && pre->freq > p->freq) q = pre; pre = p; p = p->link; }

if (p == NULL) return false; p->freq++;

pre->link = p->link;

p->link = q->link; q->link = p; return true; };

23.111A08213FF0 324010240 413FEC 5248 70FE8PC 6x sin

360

本文来源：https://www.bwwdw.com/article/2jo4.html