青岛科技大学2017年《861数据结构》考研专业课真题试卷
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
4. (15 )
key={32,75,31,63,48,94,25,47,18,70},
{12 2 16 30 28 10 16* 20 6 18}
2
3
void Sort ( SqList &L ) { for ( i = 2; i <= L.length ; ++i )
{ L.r[0] = L.r[i]; low = 1 ; high = i-1 ; while ( low <= high ) { m = ( low + high ) / 2 ; if ( L.r[0].key < L.r[m]. key ) high = m -1 ; else low = m + 1; }
for ( j=i-1; j>=high+1; - - j ) L.r[j+1] = L.r[j]; L.r[high+1] = L.r[0]; } } // Sort
1. 20
60
head
x 2 20
1 1 3 20
3
3
百度文库
1
22
150
2
3
(2
30 )
1
A
B
C
D
2
i=1;
While(i<n)i=i*2;
A O(1)
B)O(log2n)
C)O(n)
D)O(nlog2n)
3
A
B
C
D
4
A
B
C
D
5
a,b,c,d,e
d
A3
B4
C5
D6
6
P
P
S
A S->next=P; P->next=S;
B S->next=P->next; P=S;
B AD
C DE
D BD
10
T
ABCDEFGHI
AC
DG
FI
3
0
F
AB
BE
CD
DC
11
a,b,c,d,e,f,g
A a,b,c,e,d,f,g B g,e,f,d,c,b,a C b,c,a,f,e,g,d D d,c,f,e,b,a,g
12
n
A) n*n
B) n*n/2
C) n*(n+1)/2
D) (n+1)*(n+1)/2
13 n
()
A)n* n-1)
B)n+1
C) n-1
D)n
14
(10,14,26,29,41,52)
A) 3
B) 15
C) 10
D)25
15
12
()
A)4
B)2.5
C)3.1
D)5
60
1 15
8
0.07 0.19 0.02 0.06 0.32 0.03 0.21 0.10
8
2. 15
AOE-
3 15 HT[11]
C S->next=P->next; P->next=S;
D P->next=S; S->next=P;
7
n
A 2n
B 2n+1
C 2n-2
D 2n-1
8
K
A 2k+1
B 2k-1
() C 2k-1 -1
D 2k+1
9
A(5,3),B(3,5),C(2,1),D(3,3),E(5,1)
G
G
G
1
3
A EA
key={32,75,31,63,48,94,25,47,18,70},
{12 2 16 30 28 10 16* 20 6 18}
2
3
void Sort ( SqList &L ) { for ( i = 2; i <= L.length ; ++i )
{ L.r[0] = L.r[i]; low = 1 ; high = i-1 ; while ( low <= high ) { m = ( low + high ) / 2 ; if ( L.r[0].key < L.r[m]. key ) high = m -1 ; else low = m + 1; }
for ( j=i-1; j>=high+1; - - j ) L.r[j+1] = L.r[j]; L.r[high+1] = L.r[0]; } } // Sort
1. 20
60
head
x 2 20
1 1 3 20
3
3
百度文库
1
22
150
2
3
(2
30 )
1
A
B
C
D
2
i=1;
While(i<n)i=i*2;
A O(1)
B)O(log2n)
C)O(n)
D)O(nlog2n)
3
A
B
C
D
4
A
B
C
D
5
a,b,c,d,e
d
A3
B4
C5
D6
6
P
P
S
A S->next=P; P->next=S;
B S->next=P->next; P=S;
B AD
C DE
D BD
10
T
ABCDEFGHI
AC
DG
FI
3
0
F
AB
BE
CD
DC
11
a,b,c,d,e,f,g
A a,b,c,e,d,f,g B g,e,f,d,c,b,a C b,c,a,f,e,g,d D d,c,f,e,b,a,g
12
n
A) n*n
B) n*n/2
C) n*(n+1)/2
D) (n+1)*(n+1)/2
13 n
()
A)n* n-1)
B)n+1
C) n-1
D)n
14
(10,14,26,29,41,52)
A) 3
B) 15
C) 10
D)25
15
12
()
A)4
B)2.5
C)3.1
D)5
60
1 15
8
0.07 0.19 0.02 0.06 0.32 0.03 0.21 0.10
8
2. 15
AOE-
3 15 HT[11]
C S->next=P->next; P->next=S;
D P->next=S; S->next=P;
7
n
A 2n
B 2n+1
C 2n-2
D 2n-1
8
K
A 2k+1
B 2k-1
() C 2k-1 -1
D 2k+1
9
A(5,3),B(3,5),C(2,1),D(3,3),E(5,1)
G
G
G
1
3
A EA