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=
n-k+i) i--; a[i]= a[i] + 1; for (j= i+1;j 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;ia[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 gi tr ca li sau [d]--Li
trc nhn gi tr = 02
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
3
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
