武汉科技大学2020年《856数据结构与计算机网络》考研专业课真题试卷【含参考答案】

L0
R2
L1
R1 DNS
Internet
6
7
R1 R2
14 2
IP
IP
202.117.1.0/24
120
24
R1
34
R2
IP 1
1
2
1
2
7
7
2020
856
B)
( 15
2
30 )
DABDC DCABA BDABC
( 10
2
20 )
1 n-1 /2 3 2n-1 54 7 9
2 1900 45 6 O(n2) 8 202.94.120.255 10 32 128
B 120
C 130
D 140
5
F
TF
AT
BT
1
Байду номын сангаасCT
DT
6
6
1
8
,
()
A 39
B 52
C 110
D 111
1
7
7
A
C
8
A 95 22 91 24 94 71
C 21 89 77 29 36 38
9
25 13 10 12 9
B D
B 12 25 71 68 33 34 D 92 20 91 34 88 35
{
for(i=0;i<lena-lenb;i++) pa=pa->next;
}
else
{
for(i=0;i<lenb-lena;i++) pb=pb->next;
}
p=NULL; // p
while(pa)
{
if(pa->data==pb->data)
{
if(p==NULL) p=pa;
2
4
} else p=NULL; pa=pa->next; pb=pb->next; } } 5 10
2
B1 1
H1
H2
MAC1 MAC2
2
H3
B2 1
MAC3
2
H4
H5
MAC4 MAC5
5
7
1
2
1
2
H4 H5 H1 H3 H2 H1 H3 H4 H5 H3
7 10 TCP
cwnd
n
cwnd 1 2 4 8 16 32 33 34 35 36 37 38 39
n 1 2 3 4 5 6 7 8 9 10 11 12 13
( 10
2
20 )
(8
80 )
19
14
k=i+j-2
25
i= k+1 /2+1 j= k+1 /2+1-k%2
29
12
ABCDE F
A 0 10
15
B 10 0 7 5
C
708
D
58064
E 15
603
F
430
1
4
22
ABECDF
33
1
A
2
B
3
C
4
D
5
E
6
F
2
5 /\
1
3
4 /\
2
4 /\
2
3
5
6 /\
IP
IP
IP
2
C 0.5
D 0.25
(
)
B x6+x5+x4+1
D x5+x3+x2+x
2
7
( 10
1
L a1 a2
2
20 )
2
2020
120
3n
46
5 22
6n
7
8
IP
9
____________ ____________
202.93.120.34
202.94.120.0
____________
_________
B[k A[i,j
14
25
29
12
22
A
33
42
A
3 10
16 1 23 28 55 20 13 26
10
H key =key mod 7 Hi=(H(key)+di) mod 10 (di=12,22,32, ,)
16
22
32
4 10
4
7
9 Lb= 21 6 8 9
NULL
La= 35 34 5 6 8 689
1
4
6 /\
4
5 /\
42
ABCDEF
3 10
16 22
012345678 9
28 1 16 23
13 55 20
26
1112
412
3
ASLsucc =15/8
3 2 ASLunsucc = 6+5+4+3+2+1+4+3+2+1 /10=31/10
4 10
LinkList Fun(LinkList La,LinkList Lb) {
________
10 IPv4
___________ IPv6
___________
( 10
2
20
×)
1
Head
Head->next= =NULL
2S
4
6
ABCDEF
ADEBCF
3
4
,
,u
v
,
,u v
5 AOE
6
O(nlogn)
7
FDM
8 LAN
9
PCM
10
3
7
(8
80 )
19
A[n n]
B[0
2n-2]
5 10
a+ b* c-d - e/f a+b * c* -d
a*b + - c-d
-
+
/
*
+
*
+
*
-
a * e fa b c - a b
b-
d
cd
cd
typedef struct Node char data[2] // struct Node *left, *right //
*BiTree
6 10
cwnd 40 41 42 21 22 23 24 25 26 1 2 4 8
n 14 15 16 17 18 19 20 21 22 23 24 25 26
1
2
TCP
2
2
TCP
3
3
5
20
25
ssthresh
4
1
5
2
26 cwnd
100
?
ssthresh
8 12
R2 IP
R1 E0
R1 R2
L0 R2
18
A1
B2
10 TCP/IP
A
C
11
PPP
A
C
IP
12
IP
A 192.168.10.0
C 127.10.10.17
13
A
IP
B
IP
C
IP
D
ARP
14
8
A4
B 0.8
15 CRC A x5+x4+x3+1 C x5+x3+x2+1
101101
C4
D5
B D
B
IP
D
IP
B 110.47.10.255 D 211.60.2.21
int lena=0,lenb=0; p=La->next; // La while(p){ lena++; p=p->next; } p=Lb->next; // Lb while(p){ lenb++; p=p->next; }
pa=La->next; // pa pb
pb=Lb->next;
if(Lena>lenb)
void BTreeToExp(BiTree root, int deep) {
if(root==NULL) return; else if(root->left==NULL&&root->right==NULL)
printf("%s",root->data); else {
if(deep>1) printf("("); BTreeToExp(root->left,deep+1); printf("%s",root->data); BTreeToExp(root->right,deep+1); if(deep>1) printf(")"); } }
2020
856
B)
( 15
2
30 )
1
A
B
C
D
n
2
p
A p->next = p->next->next;
B p = p->next; p->next->next;
C free p->next ;
D p = p->next->next
3
A
B
C
D
4
A[0..10,0..10]
2
100
A[5,5]
A 110