1 - Kt qu no ng khi thc hin gii thut sau:

long lt(int n)
{if (n==0) return 1;
else return (2*lt(n-1);
}
[a]--lt(12) = 2010
[b]--lt(12) = 1024
[c]--lt(7) = 720
[d]--lt(6) = 64
2 - Kt qu no ng khi thc hin gii thut sau vi a[]= {1, 3, 5}; n= 5, k= 3 :
void ToHopKe(int a[], int n, int k)
{int i, j, tmp = 0;
for (i= 1;i<= k; i++)
if (a[i]!= n-k+i) {tmp= 1;break;}
if (tmp==0) return;
i= k;
while (a[i]>= n-k+i) i--;
a[i]= a[i] + 1;
for (j= i+1;j <=k;j++) a[j]= a[i] + j - i;
for (i= 1; i<= n; i++) printf("%d ", a[i]);
}
[a]--2 3 4
[b]--1 2 3
[c]--1 4 5
[d]--2 3 5
3 - Kt qu no ng khi thc hin gii thut sau vi a[]= {-3, -3, 15, -3}; n= 4; x= -3:
int FindX(int a[], int n, int x)
{int i;
for (i= n; i>= 1; i--) if (a[i]==x) return (i);
return (-1);
}
[a]--4
[b]--3
[c]--2
[d]--1

4 - Du hiu no di y cho bit danh sch lin kt n L l rng:

[a]--(L->next == NULL)
[b]--(L == NULL)
[c]--(L->nfor == NULL)
[d]--(L->left == NULL)
5 - Kt qu no ng khi thc hin gii thut sau vi a[]= {1, 3, 5, 4, 2}; n= 5:
void HoanViKe(int a[],int n)
{int i, k, r, s, tmp = 0;
for(i=1;i<=n;i++) if(a[i]!=n-i+1)
{tmp=1;break;}
if(tmp==0) return;
i= n-1;
while(a[i]>a[i+1]) i= i - 1;
k= n;
while(a[k]< a[i]) k= k - 1;
tmp= a[i]; a[i]= a[k]; a[k]=t mp;
r= i+1; s= n;
while(r< s)
{tmp = a[r]; a[r]= a[s]; a[s]= tmp; r++; s--; }
for(i= 1; i<= n; i++) printf("%d ", a[i]);
}
[a]--1 4 2 3 5
[b]--5 4 3 2 1
[c]--1 4 5 3 2
[d]--1 3 4 2 5
6 - Thao tc no di y thc hin trn hng i (queue):
[a]--Thm v loi b phn t ti v tr bt k
[b]--Thm phn t vo li sau
[c]--Loi b phn t li sau
[d]--Thm phn t vo li trc
7 - Du hiu no di y cho bit hng i c thao tc thm v loi b phn t l
rng:
[a]--Li sau nhn gi tr = 0
[b]--Li trc c gi tr < gi tr ca li sau
[c]--Li trc c gi tr > gi tr ca li sau
[d]--Li trc nhn gi tr = 0
2

8 - Thao tc no di y thc hin trn ngn xp (stack):

[a]--Thm phn t vo v tr bt k
[b]--Loi b phn t ti v tr bt k
[c]--Thm v loi b phn t lun thc hin ti v tr nh (top)
[d]--Thm v loi b phn t c th thc hin ti v tr bt k
9 - Nt c kha ln nht trong cy nh phn tm kim khc rng l:
[a]--Nt con bn phi nht
[b]--Nt con bn tri nht
[c]--Nt gc
[d]--Tt c cc nt
10 - Trong php duyt cy nh phn c 24 nt theo th t sau, nt gc c th t:
[a]--Th 1
[b]--Th 2
[c]--Th 23
[d]--Th 24
1 - Nt c kha nh nht trong cy nh phn tm kim khc rng l:
[a]--Nt gc
[b]--Tt c cc nt
[c]--Nt con bn phi nht
[d]--Nt con bn tri nht
2 - Cy nh phn khc rng l cy:
[a]--Mi nt (tr nt l) u c hai nt con
[b]--Tt c cc nt u c nt con
[c]--Mi nt c khng qu 2 nt con
[d]--Tt c cc nt u c nt cha
3 - th G c n nh v m cnh vi m n th ma trn k ca G lun c dng :
[a]--L ma trn vung cp n
[b]--L ma trn cp nxm
[c]--L ma trn vung cp m
[d]--L ma trn cp mxn

4 - th v hng G c chu trnh Euler khi v ch khi :

[a]--G lin thng v mi nh G c bc chn
[b]--Mi nh G c bc chn
[c]--G c chu trnh Hamilton
[d]--G l lin thng
5 - th G l lin thng khi v ch khi:
[a]--G l th c hng
[b]--G l th v hng
[c]--C ng i gia hai nh bt k G
[d]--G c ng i Euler
6 - Thao tc chuyn thp khi thc hin hm di y vi n= 3, a= 3 v b = 1: s cho kt
qu :
void MOVE(int n, int a, int b)
{ if(n==0) return;
MOVE(n-1, a, 6-a-b);
cout<<a<<" ==""> "<< b<< "\n";
MOVE(n-1, 6-a-b, b);
}</a<<">
[a]-1) 3=>1
2) 3=>2
3) 1=>2
4) 3=>1
5) 2=>3
6) 2=>1
7) 3=>1

[b]-1) 3=>2
2) 3=>1
3) 1=>3
4) 3=>2
5) 2=>1
6) 2=>0
7) 3=>1

[c]-1) 4=>1
2) 2=>1
3) 0=>3
4) 3=>2
5) 3=>1
6) 3=>0
7) 3=>1

[d]--Tt c u sai
7 - Kt qu ca biu thc dng hu t E= 6 27 25 - * 15 8 - 3* - khi ng dng ngn xp:
E=
[a]--E = 627
[b]--E = -546
[c]--E = 546
[d]--E = -158

8 - Vit cc phn t ca mng a[] = {27, 40, -7, 5, 57} ti mi giai on i khi p dng
thut ton sp xp la chn sp xp a theo th t gim:
(i= 5) (i= 4) (i= 3) (i= 2)
[a]-(i= 1) 17 47 -7 5 40
(i= 2) 17 40 -7 15 27
(i= 3) 27 40 27 -17 5
(i= 4) 27 40 27 5 -7

[c]-(i= 1) 57 27 -7 5 40
(i= 2) 57 40 -7 5 27
(i= 3) 57 40 27 -7 5
(i= 4) 57 40 27 5 -7

[b]-(i= 1) 27 57 -7 5 40
(i= 2) 27 40 -7 5 27
(i= 3) 27 40 27 -7 5
(i= 4) 27 40 27 5 -7

[d]-(i= 1) 7 47 -7 5 47
(i= 2) 17 40 -7 15 27
(i= 3) 27 40 17 -17 5
(i= 4) 27 40 47 15 -7

9 - Vit cc phn t ca mng a[] = {27, 40, -7, 5, 57} ti mi giai on i khi p dng
thut ton sp xp ni bt sp xp a theo th t gim:
(i= 5) (i= 4) (i= 3) (i= 2)
[a]-(i= 5) 40 27 5 57 -7
(i= 4) 40 27 57 5 -7
(i= 3) 40 57 27 5 -7
(i= 2) 57 40 27 5 -7

[c]-(i= 5) 40 47 5 27 -27
(i= 4) 40 47 27 5 -27
(i= 3) 40 27 57 5 -27
(i= 2) 57 40 57 5 -27

[b]-(i= 1) 17 47 -7 5 40
(i= 2) 17 40 -7 15 27
(i= 3) 27 40 27 -17 5
(i= 4) 27 40 27 5 -7

[d]-(i= 5) 20 37 5 57 -57
(i= 4) 40 37 57 5 -57
(i= 3) 40 17 27 5 -27
(i= 2) 57 40 57 5 -27

10 - Vit cc phn t ca mng a[] = {27, 40, -7, 5, 57} ti mi giai on i khi p dng
thut ton sp xp xen vo sp xp a theo th t gim:
(i= 5) (i= 4) ( i= 3) (i= 2)
[a]-(i= 5) 40 27 5 57 -7
(i= 4) 40 27 57 5 -7
(i= 3) 40 57 27 5 -7
(i= 2) 57 40 27 5 -7

[c]-(i= 1) 57 27 -7 5 40
(i= 2) 57 40 -7 5 27
(i= 3) 57 40 27 -7 5
(i= 4) 57 40 27 5 -7

[b]-(i= 5) 40 47 5 27 -27
(i= 4) 40 47 27 5 -27
(i= 3) 40 27 57 5 -27
(i= 2) 57 40 57 5 -27

[d]-(i= 1) 40 27 -7 5 57
(i= 2) 40 27 -7 5 57
(i= 3) 40 27 5 -7 57
(i= 4) 57 40 27 5 -7
5

1 - Vit cc phn t ca cy nh phn tm kim c to t cc nt c kha l cc s

nguyn 2, 10, 15, -5, -2, 13, -12 khi thc hin php duyt cy theo th t sau:
[a]---1 -2 -5 3 5 10

[c]---12 -2 -5 13 15 10

[b]---10 -4 -5 11 5 10

[d]---2 -12 -15 3 10 5

2 - Vit cc phn t ca cy nh phn tm kim c to t cc nt c kha l cc s

nguyn 2, 10, 15, -5, -2, 13, -12 khi thc hin php duyt cy theo th t gia
[a]---12 -5 -2 2 10 13

[c]---12 -2 -5 13 15 10

[b]--2 -5 -12 -2 10 15

[d]---10 -4 -5 11 5 10

3 - Vit cc phn t ca cy nh phn tm kim c to t cc nt c kha l cc s

nguyn 2, 10, 15, -5, -2, 12, -12 khi thc hin php duyt cy theo th t trc:
[a]---10 -4 -5 11 5 10

[c]---1 -2 -5 3 5 10

[b]---12 -2 -5 13 15 10

[d]--2 -5 -12 -2 10 15

1 - Chn pht biu ng trong cc pht biu di y: bng cch chy th 1 thut ton
vi 1 b d liu, ta c th:
[a]--Khng nh thut ton ng nu n cho kt qu ng
[b]--Khng nh thut ton sai nu cho kt qu sai
[c]--Khng nh thut ton tt nu cho kt qu nhanh
[d]--Khng nh thut ton hiu qu nu cho kt qu ng
2 - Tm mnh sai trong cc mnh sau: Mt cu trc d liu bao gm
[a]--Mt tp hp no cc d liu thnh phn
[b]--Cc d liu thnh phn t st nhau trong b nh
[c]--Kiu d liu l mt tp hp no cc phn t d liu cng chung mt thuc tnh
[d]--C A, B, C u l mnh sai
3 - Trong gii thut, bi ton lit k l :
[a]--Bi ton yu cu a ra danh sch cc cu hnh
[b]--Bi ton phn tch i tng thnh nhiu thnh phn
[c]--Bi ton tnh s t hp chp k ca n theo cng thc truy hi
[d]--Tt c u ng
4 - la chn mt gii thut tt, ta s cn c vo tiu chun :
[a]--Gii thut ng n.

[c]--Gii thut thc hin nhanh.

[b]--Gii thut n gin.

[d]--Tt c u ng
6

5 - kim tra tnh ng n ca gii thut chng ta c th :

[a]--Ci t gii thut v cho thc hin trn my vi mt s b d liu mu
[b]--o lng thi gian thc hin ca hot ng trn mt my tnh xc nh hp c
chn lc cc d liu vo.
[c]--Ci t gii thut v cho thc hin trn my vi mt s b d liu mu ri ly kt
qu thu c so snh vi kt qu bit
[d]--Xc nh bi s cc lnh c thc hin trong mt my tnh l tng.
6 - Thi gian thc hin chng trnh l :
[a]--Mt hm ca kch thc d liu vo, k hiu T(n) trong n l kch thc ( ln)
ca d liu vo.
[b]--Mt hm ca di d liu vo, k hiu N(x) trong x l di ca d liu vo.
[c]--Thi gian ngn nht thc hin chng trnh i vi mi d liu vo c cng kch thc n.
[d]--Thi gian thc hin chng trnh trong trng hp nhanh nht trn d liu vo c
kch thc n
7 - n v o thi gian thc hin l :
[a]--n v o thi gian bnh thng gi, pht ,giy...
[b]--Khng phi l n v o thi gian bnh thng nh gi, pht, giy....
[c]--c xc nh bi thi gian c thc hin trong mt my tnh l tng
[d]--Tt c u sai
8 - Khi ta ni thi gian thc hin ca mt chng trnh l T(n) = Cn th c ngha l
chng trnh y :
[a]--Cn C ch th thc thi.
[b]--Cn T(n) ch th thc thi.
[c]--Cn n ch th thc thi.
[d]--Cn Cn ch th thc thi.
9 - Thng ta coi T(n) l thi gian thc hin chng trnh trong trng hp xu nht
trn d liu vo c kch thc n, tc T(n) l :
[a]--Thi gian nh nht thc hin chng trnh i vi mi d liu vo c cng kch
thc T
[b]--Thi gian nh nht thc hin chng trnh i vi mi d liu vo c cng kch
thc n
[c]--Thi gian ln nht thc hin chng trnh i vi mi d liu vo c cng kch thc n.
[d]--Thi gian ln nht thc hin chng trnh i vi mi d liu vo c cng kch
thc T
7

10 - Phng php xc nh hiu qu thi gian thc hin ca mt gii thut l :

[a]--Lp trnh hot ng trn mt my tnh xc nh xc nh i vi tp hp c chn
lc cc d liu vo
[b]--o lng thi gian thc hin ca hot ng trn mt my tnh xc nh i vi tp
hp c chn lc cc d liu vo
[c]--C A & B u sai

[d]--C A & B u ng

1 - Trong gii thut, Ta ni rng hm khng m T(n) c t sut tng (growth rate) f(n)
nu tn ti cc hng s C v N0 sao cho :
[a]--T(n) Cf(n) vi mi n N0

[c]--T(n) Cf(n) vi mi n N0

[b]--T(n) Cf(n) vi mi n N0

[d]--T(n) Cf(n) vi mi n N0

2 - Trong t sut tng, ta c th chng minh c rng :

[a]--"Cho mt hm khng m T(n) bt k, ta lun tm c t sut tng f(n) ca n"
[b]--"Cho mt hm khng dng T(n) bt k, ta lun tm c t sut tng f(n) ca n"
[c]--"Cho mt hm T(n) bt k, ta lun tm c t sut tng f(n) ca n"
[d]--Tt c u ng
3 - Gi s T(0) = 1, T(1) = 4 v tng qut T(n) = (n+1) 2, t N0 = 1 v C = 4 th vi mi n
1 chng ta d dng chng minh c rng :
[a]--T(n) = (n+1)2 4n2 vi mi n 1, tc l t sut tng ca T(n) l n2
[b]--T(n) = (n+1)2 4n2 vi mi n 1, tc l t sut tng ca T(n) l n2
[c]--T(n) = (n+1)2 = 4n2 vi mi n 1, tc l t sut tng ca T(n) l n2
[d]--Khng th chng minh T(n) = (n+1)2
4 - T sut tng ca hm T(n) = 3n3 + 2n2 l n3. Thc vy, cho N0 = 0 v C = 5 ta d dng
chng minh rng :
[a]--Vi mi n = 0 th 3n3 + 2n2 5n3

[c]--Vi mi n 0 th 3n3 + 2n2 5n3

[b]--Vi mi n 0 th 3n3 + 2n2 5n3

[d]--Vi mi n = 0 th 3n3 + 2n2 5n3

5 - Gi s ta c hai gii thut P1 v P2 vi thi gian thc hin tng ng l T1(n) =

100n2 (vi t sut tng l n 2) v T2(n) = 5n3 (vi t sut tng l n3 ) . Gii thut no s
thc hin nhanh hn?
[a]--Cu tr li ph thuc vo kch thc d liu vo
[b]--Hai gii thut P1 v P2 c thi gian thc hin bng nhau tng ng (T2 = T1)
[c]--Gii thut P1 c thi gian thc hin nhanh hn gii thut P2 (T1
[d]--Gii thut P2 c thi gian thc hin nhanh hn gii thut P1 (T2
8

6 - Gi s ta c hai gii thut P1 v P2 vi thi gian thc hin tng ng l T1(n) =

100n2 (vi t sut tng l n 2) v T2(n) = 5n3 (vi t sut tng l n3 ) . Vi n < 20 , gii
thut no s thc hin nhanh hn?
[a]--Hai gii thut P1 v P2 c thi gian thc hin bng nhau tng ng (T2 = T1)
[b]--Gii thut P1 c thi gian thc hin nhanh hn gii thut P2 (T1
[c]--Gii thut P2 c thi gian thc hin nhanh hn gii thut P1 (T2
[d]--Cu tr li ph thuc vo kch thc d liu vo
7 - Gi s ta c hai gii thut P1 v P2 vi thi gian thc hin tng ng l T1(n) =
100n2 (vi t sut tng l n 2) v T2(n) = 5n3 (vi t sut tng l n3 ) . Vi n > 20 , gii
thut no s thc hin nhanh hn?
[a]--Hai gii thut P1 v P2 c thi gian thc hin bng nhau tng ng (T2 = T1)
[b]--Gii thut P1 c thi gian thc hin nhanh hn gii thut P2 (T1
[c]--Gii thut P2 c thi gian thc hin nhanh hn gii thut P1 (T2
[d]--Cu tr li ph thuc vo kch thc d liu vo
8 - T(n)= (n+1 )2 c t sut tng l n2 nn :
[a]--T(n)= (n+1)2 l C(n2 )

[c]--T(n)= (n+1)2 l O(n)

[b]--T(n)= (n+1)2 l O(n3 )

[d]--T(n)= (n+1)2 l O(n2 )

9 - phc tp tnh ton ca gii thut l :

[a]--Mt hm chn trn ca hm t sut
[b]--Mt hm chn di ca hm t sut
[c]--Mt hm chn trn ca hm thi gian
[d]--Mt hm chn di ca hm thi gian
10 - Hm th hin phc tp c dng thng gp l :
[a]--log2n, n, nlog2n

[c]--2n, 3n , n! , nn

[b]--n2 , n3

[d]--Tt c u ng

1 - Khi ni n phc tp ca gii thut l ta mun ni n :

[a]--Kt qu thu c sau khi thc hin ca chng trnh
[b]--Hiu qu ca thi gian thc hin ca chng trnh
[c]--Cc bc tnh ton trong qu trnh thc hin chng trnh
[d]--Tt c u ng

2 - Xc nh thi gian thc hin ca chng trnh l :

[a]--Xc nh cch bc thc hin ca gii thut
[b]--Xc nh sai st trong kt qu ca gii thut
[c]--Xc nh phc tp ca gii thut.
[d]--Tt c u ng
3 - Ta c th tnh phc tp ca mt gii thut bt k theo nguyn tc :
[a]--Qui tc cng

[b]--Qui tc nhn

[c]--Qui tc tng qut phn tch mt chng trnh

[d]--Tt c u ng
4 - Trong qui tc cng, Nu T1(n) v T2(n) l thi gian thc hin ca hai on chng
trnh P1 v P2; v T1(n)=O(f(n)), T2(n)=O(g(n)) th thi gian thc hin ca on hai
chng trnh ni tip nhau l :
[a]--T(n)=O(min(f(n),g(n)))

[c]--T(n) = O(f(n).g(n))

[b]--T(n)=O(max(f(n),g(n)))

[d]--T=O(max(f(n),g(n)))

5 - Lnh gn x:=15 tn mt hng thi gian hay O(1), Lnh c d liu READ(x) tn mt
hng thi gian hay O(1).Vy thi gian thc hin c hai lnh trn ni tip nhau l :
[a]--O(max(1,1))=O(1)

[c]--O(min(1,1))=O(1)

[b]--O(max(0,0))=O(1)

[d]--O(min(0,0))=O(1)

6 - Trong qui tc nhn, Nu T1(n) v T2(n) l thi gian thc hin ca hai on chng
trnh P1v P2 v T1(n) = O(f(n)), T2(n) = O(g(n)) th thi gian thc hin ca on hai
on chng trnh lng nhau l :
[a]--T(n)=O(min(f(n),g(n)))

[c]--T(n) = O(f(n).g(n))

[b]--n)=O(max(f(n),g(n)))

[d]--T(n2) = O(f(n).g(n))

7 - Trong qui tc tng qut, thi gian thc hin ca mi lnh gn, READ, WRITE l :
[a]--C(0)

[c]--O(0)

[b]--C(1)
[d]--O(1)
8 - Thi gian thc hin ca mt chui tun t cc lnh c xc nh bng :
[a]--Qui tc cng

[c]--Qui tc nhn

[b]--Qui tc tr

[d]--Tt c u ng

9 - Qui tc khi thi hnh mt lnh no lu nht trong chui lnh l :

[a]--Qui tc cng

[c]--Qui tc nhn

[b]--Qui tc tr

[d]--Qui tc tng qut

10

10 - Tnh thi gian thc hin T(n) ca th tc sp xp "ni bt" :

[a]--T(n) = [n(n -1 )] / 2 = O(n)

[c]--T(n) = [n(n +1 )] / 2 = O(n)

[b]--T(n) = [n(n -1 )] / 2 = O(n2)

[d]--T(n) = [n(n +1 )] / 2 = O(n2 )

1 - Dng tng qut ca mt phng trnh quy s l:

[a]--

[b]--

[c]--

[d]--

2 - Phng php gii phng trnh quy l :

[a]--Phng php truy hi
[b]--Phng php on nghim
[c]--Li gii tng qut ca mt lp cc phng trnh quy
[d]--Tt c u ng
11

3 - Phng php truy hi l :

[a]--Dng quy thay th bt k T(m) vi m < n vo pha phi ca phng trnh cho
n khi tt c T(m) vi m > 1 c thay th bi biu thc ca cc T(1) hoc T(0).
[b]--Ta on mt nghim f(n) v dng chng minh quy np chng t rng T(n) f(n)
vi mi n.
[c]--Ly mt n v thi gian v thi gian chia bi ton kch thc n thnh cc bi ton
con kch thc
[d]--Tt c u sai
4 - Phng php on nghim l :
[a]--Dng quy thay th bt k T(m) vi m < n vo pha phi ca phng trnh cho
n khi tt c T(m) vi m > 1 c thay th bi biu thc ca cc T(1) hoc T(0).
[b]--Ta on mt nghim f(n) v dng chng minh quy np chng t rng T(n) f(n)
vi mi n.
[c]--Ly mt n v thi gian v thi gian chia bi ton kch thc n thnh cc bi ton
con kch thc
[d]--Tt c u sai
5 - Gii phng trnh :

[a]--T(n) = T(0) + nC2 = C1 + n C2 = O(n)

[b]--T(n) = T(0) - nC2 = C1 - n C2 = O(n)
[c]--T(n) = T(0) + nC2 = C1 + n C2 = O(n)
[d]--T(n) = T(0) - nC2 = C1 - n C2 = O(n)
6 - Gii phng trnh :

[a]--T(n) = nT(0) - lognC2 n = C1 n - C2 nlogn = O(nlogn).

[b]--T(n) = nT(0) + lognC2 n = C1 n + C2 nlogn = O(nlogn).
[c]--T(n) = nT(1) - lognC2 n = C1 n - C2 nlogn = O(nlogn).
[d]--T(n) = nT(1) + lognC2 n = C1 n + C2 nlogn = O(nlogn).

12

7 - Gii phng trnh quy :

[a]--T(n) (C1 + C 2)nlogn +C1 , n

[c]--T(n) (C1 - C 2)nlogn - C1 , n

[b]--T(n) (C1 - C 2)nlogn + C1 , n

[d]--Tt c u sai

1 - Khi gii mt phng trnh quy khng thuc dng phng trnh tng qut th s
dng phng php :
[a]--Truy hi

[c]--K hiu ln

[b]--on nghim

[d]--A v B u ng

2 - Trong bi ton sp xp, sp xp trong l :

[a]--S sp xp d liu c t chc trong b nh trong ca my tnh
[b]--L s sp xp c s dng khi s lng i tng cn sp xp ln khng th lu tr
trong b nh trong m phi lu tr trn b nh ngoi
[c]--L s sp xp d liu c t chc sp xp d liu c lu tr trong cc tp tin
[d]--Tt c u sai
3 - Trong bi ton sp xp, sp xp ngoi l :
[a]--S sp xp d liu c t chc trong b nh trong ca my tnh
[b]--L s sp xp c s dng khi s lng i tng cn sp xp ln khng th lu tr
trong b nh trong m phi lu tr trn b nh ngoi
[c]--L s sp xp d liu c t chc sp xp d liu c lu tr trong cc tp tin
[d]--Tt c u sai
4 - Cc i tng cn c sp xp l cc mu tin gm :
[a]--1 trng

[c]--3 trng

[b]--2 trng

[d]--1 hoc nhiu trng

5 - Mc ch ca vic sp xp l :
[a]--S dng kh nng truy nhp ngu nhin ca b nh truy nhp c thc hin
nhanh.
[b]--T chc li cc mu tin sao cho cc kha ca chng c sp th t tng ng vi
quy lut sp xp
[c]--Tm kim mt i tng trong mt danh sch cc i tng bng gii thut tm kim
nh phn nhanh chng
[d]--Tt c u ng
13

6 - Cc gii thut n gin thng ly thi gian l :

[a]--O(n)

[c]--O(n3)

[b]--O(n2)

[d]--Tt c u ng

7 - Mi gii thut chng ta s nghin cu cc phn :

[a]--Gii thut, v d

[c]--Phn tch nh gi

[b]--Chng trnh

[d]--Tt c u ng

8 - Phng php sp xp n gin nht l :

[a]--Sp xp xen (Insertion Sort)

[c]--Sp xp chn (Selection Sort)

[b]--Sp xp ni bt (Bubble Sort)

[d]--Tt c u ng

9 - Phng php chn l :

[a]--Lp li qu trnh chn phn t nh nht trong s cc phn t cha c sp
[b]--Lp li qu trnh chn phn t trung bnh trong s cc phn t cha c sp
[c]--Lp li qu trnh chn phn t ln nht trong s cc phn t cha c sp
[d]--Lp li qu trnh chn phn t ln nht trong s cc phn t c sp
10 - Sp xp mng gm 10 mu tin c kha l cc s nguyn: 5, 6, 2, 2, 10, 12, 9, 10, 9 v
3 . Phng pho no l nhanh chng nht :
[a]--Sp xp xen (Insertion Sort)

[c]--Sp xp chn (Selection Sort)

[b]--Sp xp ni bt (Bubble Sort)

[d]--Tt c u ng

1 - Vn chn cht trong thit k gii thut,trong hai phn t c kha khc nhau u
tin k t tri qua ta chn :
[a]--Kha bng ch s trung bnh

[c]--Kha ln nht

[b]--Kha nh nht

[d]--Khng c kha

2 - Trong thit k gii thut, nu mng ch gm mt phn t hay gm nhiu phn t c

kha bng nhau th :
[a]--Gii thut khng c cht

[c]--Gii thut c 2 cht

[b]--Gii thut c 1 cht

[d]--Gii thut c t 2 cht tr ln

3 - Cho mng gm cc phn t c kho l 6, 6, 5, 8, 7, 4. Cht ca mng l :

[a]--5

[c]--8

[b]--6

[d]--7

14

4 - Cho mng gm cc phn t c kho l 6, 6, 7, 5, 7, 4. Cht ca mng l :

[a]--5

[c]--8

[b]--6

[d]--7

5 - Cho mng gm cc phn t c kho l 6, 6, 6, 6, 6, 6. Cht ca mng l :

[a]--0

[c]--6

[b]--1

[d]--Mng ny khng c cht

6 - Cho mng gm mt phn t c kho l 6. Cht ca mng ny l :

[a]--0

[c]--6

[b]--1

[d]--Mng ny khng c cht

7 - Trong vn phn hoch, phn hoch mng ta dng 2 "con nhy" l :

[a]--L v R trong L t bn tri v R t bn phi
[b]--L v R trong L t bn phi v R t bn tri
[c]--T v D trong T t bn trn v D t bn di
[d]--T v D trong T t bn di v D t bn trn
8 - Trong gii thut QuickSort, cc bc tin hnh sp xp mng a[i]..a[j] l :
[a]--Xc nh cht - Phn hoch mng cho thnh hai mng con a[i]..a[k-1] v a[k]..a[j].
- Sp xp mng a[i]..a[k-1] ( quy ) - Sp xp mng a[k]..a[j] ( quy)
[b]--Phn hoch mng cho thnh hai mng con a[i]..a[k-1] v a[k]..a[j]. - Xc nh
cht - Sp xp mng a[i]..a[k-1] ( quy ) - Sp xp mng a[k]..a[j] ( quy)
[c]--Phn hoch mng cho thnh hai mng con - Sp xp mng a[i]..a[k-1] ( quy ) Sp xp mng a[k]..a[j] ( quy) - Xc nh cht
[d]--Tt c u sai

15