Congdonghubt.Vn: Câu Hỏi Và Ñáp Án C++

CongDongHUBT.
VN
Cu hi v p n C++
Cu 1 : An vit hm tnh giai tha ca s nguyn dng

nh sau:
unsigned long GT(int n)
{ if (n == 1) return 1L;
else return n*GT(n-1);
}
cn Bnh li vit nh sau:
{ if (n == 1) return 1L;
return n*GT(n-1);
}
Ai ng, ai sai?
-- >> (*)[d] An v Bnh u ng
Cu 2 : An vit hm tnh giai tha ca s nguyn dng
nh sau:
int GT(int n)
{ if (n == 1) return 1; return n*GT(n-1);
}
cn Bnh li vit nh sau:
{ if (n == 1) return 1L; return n*GT(n-1);
}
Khi tnh giai tha ca 12, c hai u nhn c kt qu
nhng
-- >> (*)[c] Kt qu ca Bnh ng, ca An sai
B
Cu 3 : Bng m ASCII m rng c bao nhiu k t?
-- >> (*)[b] 256
C
Cu 4 : Cu lnh return c s dng
-- >> (*)[d] Tr gi tr v cho mt hm
Cu 5 : Cho bit kt qu ca on chng trnh sau:
for (i = 1, s = 0; i <= 10; i+= 2)
s += i;
-- >> (*)[b] s = 25
Cu 6 : Con tr c s dng
>> (*)[a] Cha gi tr ca 1 bin
Cu 7 : Cho on chng trnh sau:
#include <stdio.h>
#include<conio.h>
void main(){
int *p, a=10, b;
p = &a;
b = 2*p;
printf("\n%d", b);
}
Kt qu s xut hin l
-- >> (*)[d] L mt s nguyn bt k
Cu 8 : Cho on chng trnh sau

#include <stdio.h>
#include<conio.h>
void main(){
int a, b, c;
a = int(1.5*(11/3));
b = (int)(1.4*10);
c = (int)1.4*10;
printf("\n%d\t%d\t%d",a,b,c);
}
Kt qu xut hin l
-- >> (*)[c] 4
13 10
#include <stdio.h>
void main(){
char ht[25];
int t;
printf("\n Tuoi:");
scanf("%d", &t);
printf("\nHo ten:");
gets(ht);
}
on chng trnh trn nhp tui v h tn cho mt
ngi theo bn th cn b xung thm lnh g trong cc lnh
sau y vo chng trnh
-- >> (*)[c] fflush(stdin)
Cu 10 : Chng trnh sau y hin th g trn mn hnh?
#include <stdio.h>
#include <conio.h>
#include <string.h>
void main()
{ char *s = "Ha Noi mua thu, Mua thu Ha Noi";
clrscr(); printf("\n%s", s);
for (int i = 0; i < strlen(s); i++) printf("\b%c\b", 32);
getch();
}
-- >> (*)[d] Khng hin th g
Cu 11 : Cho chng trnh sau
#include <stdio.h>
#include <conio.h>
int a;
void main()
{ if (a) printf("\nHow are you?");
else printf("\nWhere are you from?");
getch();
}
Bn c th thy kt qu hin th nh th no?
-- >> (*)[b] Chc chn l "Where are you from?"
Cu 12 : Cho chng trnh sau:
#include <stdio.h>
#include <conio.h>
void main()
{ int a;
if (a) printf("\nI am fine");
else printf("\nI am bad");
getch();
}
Bn c th thy kt qu hin th nh th no?
-- >> (*)[a] Gn nh chc chn l "I am fine"

#include <stdio.h>
#include <conio.h>
void main()
{ int a = 10;
clrscr();
printf("\n%d\t%d", ----------a, ++++++++++a);
getch();
}
Bn d on kt qu s nh th no?
-- >> (*)[b] 10
15
Cu 14 : Cho hm sau:
void Invers(char *s)
{ char *t = s + strlen(s) - 1;
while (s < t)
{ char c = *s;
*s++ = *t;
*t-- = c;
}
}
Cho xu S = "ESTIH". Li gi
Invers(S);
s lm xu S thay i nh th no?
-- >> (*)[d] "HITSE"
#include <stdio.h>
#include <conio.h>
void main()
{ int a = 10; clrscr();
----------a;
++++++a;
printf("\n%d", a);
getch();
}
-- >> (*)[d] 8
#include <stdio.h>
#include <conio.h>
void main()
{ char a = "A", b = "B";
clrscr();
printf("\n%c\t%d", a & b, a && b);
getch();
}
-- >> (*)[d] A 1
Cu 17 : Cho on lnh sau:
for (i = 0, j = 1; i < n-1 && j < n; j = (j + 1) % n)
{ if (!j) j = ++i + 1;
if (a[j] < a[i])
{ int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
Cho bit chc nng ca on lnh trn.
-- >> (*)[a] Sp xp mng tng dn
Cu 18 : Cho bit kt qu ca cc lnh sau:

int x = 5, y = 4;
printf("\n%d\t%d", x & y, x^y);
[a] 9 625
[b] 1 4
[c] 5 1
-- >> (*)[d] 4 1
char a = "A", b = "B", c = a + b/2;
printf("\n%d\t%d\t%c", a, b, c);
-- >> (*)[a] 65 66
b
int a = 5; char c = "A"; float x = 1.5;
a = c + x;
x = a + c;
c += 2;
printf("\n%d\t%5.2f\t%c", a, x, c);
-- >> (*)[c] 66
131.00 C
char s[] = {"A", "\0", "\0", "B", "C", "\0"};
int *k = (int *)s;
for (int i = 0; i < 3; i++)
printf(" %d", *k++);
-- >> (*)[b] 65 16896 66
Cu 22 : Cho bit kt qu cc lnh sau:
char s[5] = {"A", "B", "\0", "B", "C", "\0"};
printf("\n%s", s);
-- >> (*)[b] AB
Cu 23 : Cho bit kt qu ca on chng trnh sau:
for (i = 1, s = 0; i <= 10; s += i++);
-- >> (*)[b] s = 55
Cu 24 : Cho bit hm sau y c th dng tnh giai
tha cho s nguyn dng ln nht l bao nhiu?
int GT(int n)
{ int g = 1;
for (int i = 2; i <= n; i++)
g *= i;
return g;
}
-- >> (*)[a] 7
Cu 25 : Cho bit khi thc hin cu lnh sau. bin k c
gi tr l bao nhiu?
int k = (a > b)? 10:20;
bit a = 200, b = 100.
-- >> (*)[a] 10
Cu 26 :Cho cc dng khai bo sau:
void main()
{ int m[5] = {2, 3, 7};
printf("%d", m[4]);
Cho bit dng trn y in ra s no?
-- >> (*)[d] Khng th bit trc
Cu 27 : Cho cc dng khai bo sau:
int m[5] = {2, 3, 7};
void main()
{ printf("%d", m[4]);
Cho bit dng trn y in ra s no?
-- >> (*)[c] 0

int a = 5, b = 5, c;
if (--a > --b)
c = 10;
else if (--a > b--)
c = 20;
else c = 30;
Cho bit khi thc hin xong on trnh ny c c gi tr
l bao nhiu?
-- >> (*)[d] 30
clrscr();
gotoxy(20, 5);
cprintf("%d", a);
Cho bit khi thc hin on chng trnh ny, gi tr a
s c in ra v tr no trn mn hnh.
-- >> (*)[a] Ct 20 dng 5
Cu 30 : Cho bit kt qu thc hin on chng trnh
sau:
i = s = 0;
while (i++ <= 10)
s += i++;
-- >> (*)[c] 25
Cu 31 : Cho khai bo sau:
1/ typedef struct HocSinh { char HoTen[20];
2/
float DTK; };
3/ void Xuat(HocSinh h)
4/ { printf("\nHo va ten : %s", h->HoTen);
5/ printf("\nDiem tong ket: %6.2f", h->DTK);
7/ }
Dng 4 v dng 5 ca on ny c li bin dch. Hy
chn phng n sa hp l:
-- >> (*)[d] Sa h-> thnh h.
Cu 32 : C th nhp mng mt chiu c cc phn t
l s thc theo cch sau hay khng?
for (int i = 0; i < n; i++)
{ printf("\nCho A[%d]: ", i);
scanf("%f", &A[i]);
}
-- >> (*)[b] Khng
Cu 33 : Cho bit hm sau y c chc nng g?
unsigned long Factorial(int n)
{ if (n == 1) return 1;
else return n*Factorial(n-1);
}
-- >> (*)[b] Tnh giai tha ca mt s nguyn dng
Cu 34 : C th nhp mng mt chiu c cc phn t
l s thc theo cch sau hay khng?
for (int i = 0; i < n; i++)
float x;
scanf("%f", &x);
A[i] = x;
}
-- >> (*)[a] C

#include <stdio.h>
void main()
{ int a = 5, b = 5, c = 5, d;
d = a++;
d += b;
c += ++d;
printf("\nc = %d", c);
}
Cho bit kt qu in ra c l bao nhiu?
-- >> (*)[b] 16
Cu 36 : Cho dng khai bo sau:
int m[] = {2, 3, 7};
Cho bit trnh bin dch ca C s cp pht cho mng m
b nh cho bao nhiu phn t.
-- >> (*)[a] 3
Cu 37 : Cho bit hm sau y c chc nng g:
float T(float *m, int n)
{ float t = 0.0;
for (int i = 0; i < n; i++)
t += m[i];
return t;
}
-- >> (*)[c] Tnh tng cc phn t ca mng
int a = 5, b = 5, c;
if (++a > ++b)
c = 10;
else if (++a > b++)
c = 20;
else c = 30;
Cho bit khi thc hin xong on trnh ny c c gi tr l
bao nhiu?
-- >> (*)[c] 20
1/ struct HocSinh { char HoTen[20]; float DTK; };
2/ void Nhap(HocSinh *h)
3/ { printf("\nHo va ten : "); gets(h->HoTen);
4/ printf("\nDiem tong ket: ");
5/ float x; scanf("%f", &x); h->DTK = x;
6/ }
Khi dch chng trnh th dng th 2 ca on ny c li:
'HocSinh cannot start a parameter declaration'.
Cho bit mt cch khc phc.
-- >> (*)[a] Thm t kho typedef vo u dng 1
int a = random(3);
switch (a)
{ case 0:;
case 1:;
case 2: printf("Blue "); break;
case 3: printf("White "); break;
}
Sau khi thc hin cu trc trn y s thy g trn mn
hnh?
-- >> (*)[a] Blue

int a = 5, b = 6, c = 7, d = 8;
int k = a = b && c - d;
k bng bao nhiu?
-- >> (*)[b] 1
typedef struct CanBo { char HoTen[20]; int NamSinh;};
void Nhap(CanBo *cb)
{ printf("\nHo va ten : "); gets(cb->HoTen);
printf("\nNam sinh : ");
scanf("%d", &cb->NamSinh);
}
Vi cch t chc d liu nh trn th cc bn ghi kiu
CanBo thc t trong khi chng trnh lm vic c
cp pht lng b nh c nh hay khng?
-- >> (*)[a] C nh
a = 0;
if (a)
b = 0;
else
b = 1;
Cho bit sau khi thc hin on lnh ny b c gi tr l
bao nhiu?
-- >> (*)[b] 1
1/ int b;
2/ int f = open("DULIEU.DAT",
O_RDONLY/O_BINARY);
3/ read(f, b, 2);
4/ close(f);
on chng trnh trn c li v kiu d liu. Cho bit
phng n sa.
-- >> (*)[c] dng 3 sa thnh: read(f, &b, 2);
Cu 45 : Cho hm nhp mt khu nh sau:
char *Password(){
char c, *t, *s;
s = t = (char *)malloc(20);
printf("\nType pasword: ");
while ((c=getch()) != "\x0D")
{ putch("\x2A"); *s++ = c; }
*s = "\0";
return t;
}
Bn c nhn xt g?
-- >> (*)[c] Khi g mt khu, cc k t hin ra thnh
du sao(*)
Cu 46: Chng trnh sau y dng li khi no:
#include <stdio.h>
#include <conio.h>
void main()
{ char c;
do {
printf("\nHello, world!");
if (kbhit()) c = getch();
} while (c != 27);
}
-- >> (*)[d] Khi phm Esc c nhn

typedef struct HocSinh { char HoTen[20];
float DTK; };
void Nhap(HocSinh *h)
{ printf("\nHo va ten : "); gets(h.HoTen);
printf("\nDiem tong ket: ");
float x; scanf("%f", &x); h.DTK = x;
}
HocSinh H[50];
Khi chy chng trnh ny v dng hm trn y nhp
cc thnh phn ca mng H th ch bn ghi u tin cho
php nhp trng HoTen. Cho bit cch x l.
-- >> (*)[b] Thm lnh fflush(stdin) vo ch thch hp.
Cu 48: Cho khai bo sau:
1/ typedef struct HocSinh { char HoTen[20];
2/
float DTK; };
3/ void Nhap(HocSinh *h)
4/ { printf("\nHo va ten : "); gets(h.HoTen);
5/ printf("\nDiem tong ket: ");
6/ float x; scanf("%f", &x); h.DTK = x;
7/ }
Dng 4 v dng 6 ca on ny c li bin dch. Hy
chn phng n sa hp l:
-- >> (*)[b] Sa h. thnh h->
a = 0;
if (a = 5)
b = 0;
else
b = 1;
bao nhiu?
-- >> (*)[a] 0
Cu50 : Chng trnh sau y khi chy c lc b trc trc:
1| #include <stdio.h>
2| void main()
3| { char *m;
4| printf("\nCho mt xu k t: ");
5| gets(m);
6| puts(m);
7| }
Bn cho bit li dng no? -- >> (*)[b] 3
Cu 51 : Cho on chng trnh sau y
1. char *x, y;
2. x="LAP TRINH";
3. y ="TURBO C";
4. gets(y)
5. gets(x)
Cc lnh sau y l sai hoc v ngha
-- >> (*)[a] 3 v 5
Cu 52 : Cho bit trong chng trnh sau dng no c li

bin dch:
1/ #include <stdio.h>
2/ void main()
3/ { printf("\nHello, World!");
4/ getch();
5/ }
-- >> (*)[d] 4
struct HocSinh { char HoTen[20]; float DTK; };
void Nhap(HocSinh *h)
{ printf("\nHo va ten : "); gets(h->HoTen);
printf("\nDiem tong ket: ");
float x; scanf("%f", &x); h->DTK = x;
}
Bnh thng dch on ny khng c li, nhng khi ci
t li Borland C th dch li c li. Cho bit mt
nguyn nhn ca hin tng trn.
-- >> (*)[c] Tp chng trnh c phn m rng .C
#include <stdio.h>
#include <conio.h>
void main()
{ int i = 1, k = 2;
printf("\nc = %c", i*k+64);
getch();
}
Cho bit kt qu in trn mn hnh l dng no trong s
cc dng sau:
-- >> (*)[d] c = B
int a = 0;
switch (a)
{ case 0: printf("Red ");
case 1: printf("Green ");
case 2: printf("Blue "); break;
}
Kt qu thc hin cu trc trn y s nh th no?
-- >> (*)[d] Red Green Blue
typedef struct HocSinh { char HoTen[20];
float DTK; };
HocSinh *H;
void main()
{ int n;
printf("\nCho so hoc sinh: ");
scanf("%d", &n);
H = (HocSinh *)malloc(n*sizeof(HocSinh));
Cho bit nu n nhp vo l 40 th lng b nh cp pht
cho mng H l bao nhiu byte?
-- >> (*)[a] 960 byte

#include <conio.h>
void main()
{ char *s = "Ha Noi mua nay vang...";
while (*s != "y") s++;
(--s)--;
while(*s != 32) putch(*s++);
}
cho bit kt qu in trn mn hnh l g?
-- >> (*)[c] nay
a = 0;
if (a == 5)
b = 0;
else
b = 1;
bao nhiu?
-- >> (*)[b] 1
1
#include <stdio.h>
2
void main(){
3
int x=5;
4
{ int y=x+10; }
5
printf("\x=%d",x);
6
printf("\y=%d",y);
7
}
Dng lnh no sai trong chng trnh trn
-- >> (*)[d] 6
#include <stdio.h>
void f() { static int x = 9; x+=10; printf("\t%d",x); }
void main()
{ int x=1;
f();
printf("\t%d",x);
f();
}
Kt qu? in ln khi chy chng trnh l:
-- >> (*)[b] 19 1 29
Cu 61 : Chn cu khng nh ng
Th vin dng vo stdin gm cc hm
-- >> (*)[b] scanf, gets, getchar
Cu 62 : Chn cc khng nh ng trong cc khng nh
sau:
1. a l hng k t
2. "a" l hng xu k t
3. "a" l hng xu k t gm 2 k t "a" v "\0"
4. "a" l hng xu k t gm k t a c m 97
5. K t "0" c m 48 , khng c k t "\0"
Chn p n ng sau y:
-- >> (*)[d] 2 v 3

int a = 1;
switch (a)
case 1: printf("Green "); break;
case 2: printf("Blue ");
}
-- >> (*)[b] Green
int a = 5, b = 6, c = 7, d = 8;
int k = a == b or c == d;
k bng bao nhiu?
-- >> (*)[a] 0
clrscr();
gotoxy(20, 5);
printf("%d", a);
Cho bit khi thc hin on chng trnh ny, gi tr a
s c in ra v tr no trn mn hnh.
-- >> (*)[d] Gc tri trn cng ca mn hnh
int f = creat("DULIEU.DAT", S_IREAD);
int a = {1, 2, 3, 4};
write(f, a, 6);
close(f)
f = creat("DULIEU.DAT", S_IWRITE);
write(f, a, 8);
close(f);
Cho bit sau khi thc hin on chng trnh ny, tp
DULIEU.DAT trn a c dung lng bao nhiu byte.
-- >> (*)[b] 6
Cu 67 Cho hm sau:
void Invers(char *s)
{ int i = 0, j = strlen(s) - 1;
while (i < j)
{ char c = s[i];
s[i++] = s[j];
s[j--] = c;
}
}
Cho xu S = "VIET NAM". Li gi
Invers(S);
-- >> (*)[d] "MAN TEIV"
sau:
i = s = 0;
while (i <= 10)
s += i++;
-- >> (*)[a] 45
Cu 69 : Cho bit bin f sau khi thc hin sau dng lnh
sau c gi tr bao nhiu:
float f = 3/5;
-- >> (*)[c] 0.00
Cu 70 : Cho bit trong chng trnh sau y dng no c
li:
1 / #include <stdio.h>
2 / void main()
3 / { int a, b, c;
4 / printf("\nCho a: ");
5 / scanf("%d", &a);
6 / printf("\nCho b: ");
7 / scanf("%d", b);
8 / printf("\na = %d, b = %d", a, b);
9/}
-- >> (*)[c] 7
Cu 71 : Cho chng trnh sau y
#include <stdio.h>
void sapxep(float *pa, int i)
{ int i,j; float c;
for(i=0;i<n-1;i++) for(j=i+1;j<n;j++)
if ( #1) { c=pa[i]; pa[i]=pa[j]; pa[j]=c;}
}
void main()
{ int n = 5; float a[5]={ 4.5, 8.0, 1.0, -6.2, 7.8};
#2;}
Cho cc biu thc v li gi tng ng vi cc k hiu #1
v #2 di y.
Hy chn p n ng
-- >> (*)[c] pa[j]<pa[i] v sapxep(a,n)
Cu 72 : Cho nguyn mu hm sau:
FILE *fopen(const_char *FileName, Const_char Type);
Gi tr tr v ng ca hm thuc kiu
-- >> (*)[d] con tr tp
#include <stdio.h>
#include<conio.h>
void doubleinc(int * p, int q){
*p++; ++q
}
void main(){
int a=10,b = 20;
doubleinc(&a, b);
printf("\n%d\t%d", a, b);
getch();
}
Kt qu trn mn hnh xut hin
-- >> (*)[d] 11
20
Cu 74: Cho on chng trnh sau:
int a = 0;
switch (a)
case 1: printf("Green "); break;
case 2: printf("Blue ");
}
-- >> (*)[b] Red Green

int f = creat("DULIEU.DAT", S_IREAD);
int a = {1, 2, 3, 4};
write(f, a, 8);
close(f)
Cho bit sau khi thc hin on chng trnh ny, tp
DULIEU.DAT trn a c dung lng bao nhiu byte.
-- >> (*)[d] 8
Cu 76 : Cho hm sau:
void Upper(char *s)
{ while (*s)
{ if (*s >= 97 && *s <= 122)
*s -= 32;
s++;
}
}
Cho xu S = "ha noi" th kt qu ca li gi hm:
Upper(S);
-- >> (*)[c] "HA NOI"
sau:
c = "a"- 1;
while (c < "d")
printf("%c", ++c);
-- >> (*)[d] abcd
a = 1;
if (a)
b = 0;
else
b = 1;
bao nhiu?
-- >> (*)[a] 0
int f = creat("test.dat", S_IWRITE);
int a[] = {1, 2, 3};
write(f, a, 4);
close(f);
Cho bit tp test.dat sau khi thc hin on trnh ny
c dung lng bao nhiu byte.
-- >> (*)[b] 4
#include <stdio.h>
#include<conio.h>
void main(){
int a,b=1,c=32766,d;
a = b + c++;
d = c+1;
printf("\n%d\t%d", a, d);
}
Kt qu s xut hin
-- >> (*)[b] 32767 -32768
Cu 81 : Cho bit kt qu in ra mn hnh ca chng

trnh sau y l nh th no:
#include <stdio.h>
void main()
{ char s[20];
printf("\nHo va ten: ");
scanf("%s", s);
printf("\nHo va ten: %s", s);
}
bit rng khi chy chng trnh, d liu nhp vo t bn
phm l Bui Tien Truong -- >> (*)[a] Bui
Cu 82 : Chng trnh sau y xin cp pht 5 bin ng 2
byte cha cc bnh phng ca 5 s t nhin u tin,
sau in dy cc gi tr ny ln mn hnh.
#include <stdio.h>
#include <malloc.h>
void main(){
int *p,*q, i,n=5;
p = (int*) malloc (n*sizeof(int));
q=p; for(i=1;i<=n;i++) {*q=i*i; q++;}
for(i=1;i<=n;i++) {printf("\t %d",*q); q++;}
}
chng trnh cho kt qu sai v
-- >> (*)[c] Cha t li con tr q = p trc ton t for
th 2
Cu 83 : Chng trnh sau lp bng gi tr ca cc hm
sin(x),cos(x), exp v sqrt(x) trn on [1, 10] vi s gia
bc tng l 0.5:
#include <stdio.h>
#include <math.h>
main(){
m[1]=sin; m[2]=cos, m[3]=exp; m[4]=sqrt;
{int i; double x=1.0;
while (x<=10.0)
{ for(i=1; i<=4; i++) printf("%10.2f",m[i](x)); x+=0.5;
printf("\n"); }
}
Lnh u tin trong hm main phi l lnh no:
-- >> (*)[b] double (*m[5])(double) ;
D
Cu 84 : Di y l mt chng trnh C hon chnh
khi dch khng c li.
#include <stdio.h>
void FUN(int a, int b, int c, int d)
{ c = a + b; d = a - b;}
void main()
{ int x = 3, y = 4, z, t;
FUN(x, y, z, t);
printf("\nHBP = %d", z*t);
}
Kt qu trn mn hnh sau khi thc hin chng trnh?
-- >> (*)[d] HBP = <mt s ngu nhin>
Cu 85 : on chng trnh sau tnh tng cc phn t
ca mt mng hai chiu n hng m ct nhng kt qu
khi chy th li sai hon ton:
1/ int T = 0;
2/ for (int i = 1; i <= n; i++)
3/ for (int j = 0; j < m; j++)
4/
T += m[i][j];
Bn hy chn phng n sa dng sai :
-- >> (*)[a] Sa dng 2 thnh for (int i = 0; i < n; i++)
Cu 86 : on chng trnh sau th c 2 li. Ch cn

thay i v tr ca mt lnh trong th c hai li cng
c sa.
1/ int n = 0, A[1000];
2/ do {
3/ printf("\nCho mot so nguyen: ");
4/ scanf("%d", &A[n++]);
5/ printf("\nBan co muon nhap nua khong?");
6/ char c;
7/ c = getch();
8/ } while (c == "c" or c == "C");
Bn s sa nh th no?
-- >> (*)[d] a dng 6 ln trc vng lp
Cu 87 : on chng trnh sau y c chc nng
chuyn v mt ma trn vung, tc l o hng thnh ct
v ct thnh hng nhng cha c th nghim:
1/ for (int i = 0; i < n; i++)
2/ for (int j = i + 1; j < n; j++)
3/ { int x = m[i][j];
4/
m[i][j] = m[j][i];
5/
m[j][i] = x;
6/ }
Bn c d on g v kt qu ca on chng trnh
ny?
-- >> (*)[c] Ma trn chuyn v ng nh lp
trnh
Cu 90 : on chng trnh sau dng in ln mn hnh

mt mng hai chiu di dng bng c n hng v m ct,
nhng khi chy kt qu li khng ng nh lp
trnh v dng th 4 b sai:
1/ for (int i = 0; i < n; i++)
2/ { for (int j = 0; j < m; j++)
3/
printf("%4d", a[i][j]);
4/ printf("\t");
5/ }
Bn hy chn phng n sa dng sai :
-- >> (*)[b] printf("\n");
Cu 91 : on chng trnh sau y khai bo v cp
pht b nh
cho mt mng ng gm n phn t s nguyn.
printf("\nCho n: ");
scanf("%d", &n);
int *m = (int *)malloc(n*sizeof(int));
for (int i = 0; i < m; i++)
{ printf("\nm[%d] = ", i);
scanf("%d", m+i);
}
Trong on ny c mt li cn sa. Hy chn mt trong
cc sa i sau:
-- >> (*)[b] for (int i = 0; i < n; i++)
G

1/ for (int i = 0; i < n; i++)
2/ for (int j = i + 1; j < n; j++)
3/ { int x = m[i][j];
4/
m[j][i] = m[i][j];
5/
m[j][i] = x;
6/ }
ny?
-- >> (*)[a] Ma trn tr thnh i xng qua ng
cho chnh
Cu 92 : Gi s cn tnh tng s = 1 +1/2 + 1/3 + 1/4 + ... +

1/N
ta c on chng trnh sau:
1. #include <stdio.h>
2. void main(){
3. int i, s =0.0;
4. for(i=1;i<=10;i++)
5.
s = s+1/i
6. printf("\nTong s= %f10.2",s);
7. getch();
}
Cc dng lnh sai trong on chng trnh trn l:
-- >> (*)[b] 3 v 6

1/ for (int i = 0; i < n; i++)
2/ for (int j = 0; j < n; j++)
3/ { int x = m[i][j];
4/
m[i][j] = m[j][i];
5/
m[j][i] = x;
6/ }
ny?
-- >> (*)[b] Ma trn khng h thay i
Cu 93 : Gi s trn a c tp TEST.DAT c dung

lng 20 byte. Cho thc hin on chng trnh sau:
int f = open("TEST.DAT", O_RDONLY/O_BINARY);
int a[11];
for (int i = 0; i < 11; i++) a[i] = 0;
int k = read(f, a, 22);
Bn d on xem sau lnh read phn t a[10] c gi tr l
bao nhiu.
-- >> (*)[a] 0
Cu 94 : Gi s trn a c tp TEST.DAT c dung

lng 20 byte. Cho thc hin on chng trnh sau:
int f = open("TEST.DAT", O_RDONLY/O_BINARY);
int a[40];
int k = read(f, a, 40);
Bn d on xem sau lnh read bin k c gi tr l bao
nhiu.
-- >> (*)[d] 20
Cu 95 : Gi s c cc khai bo bin v cc php gn
nh sau
int i, *p;
float x, *q;
1. p = &i;
2. q = i;
3. p = &x;
4. q = x;
5. q = & x;
Cc php gn khng hp l l
-- >> (*)[c] 3, 4
H
Cu 96 : Hm sau y sp xp mt mng mt chiu
tng dn:
1/ void SapXep(int *m, int n)
2/ { for (int i = 0; i < n - 1; i++)
3/
for (int j = i + 1; j < n; j++)
4/
if (m[j] < m[i])
5/
{ int t = m[j];
6/
m[i] = m[j];
7/
m[i] = t;
8/
}
9/ }
nhng khi chng trnh chy li cho kt qu sp xp sai.
Nguyn nhn li dng no?
-- >> (*)[b] 4
Cu 97 : Hm nh ngha di y nhm tm s ln
nht trong mt
mng s nguyn nhng c mt k t b xo v thay vo
l du ba chm.
int Max(int *m, int n)
{ int M = m[0];
for (int i = 1; i < n; i++)
if (M ... m[i]) M = m[i];
return M;
}
K t b xo l k t no?
-- >> (*)[d] <
Cu 98 : Hm sau y d kin dng sp xp cc
xu theo th t alphabet:
void SapXep(char **Ds, int n)
{ for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
if (strcmp(Ds[j], Ds[i]) > 0)
{ char *s = Ds[j];
Ds[j] = Ds[i];
Ds[i] = s;
}
}
Theo bn hm ny vit ng hay sai?
-- >> (*)[b] Sai
Cu 99 : Hm sau y dng phn loi mt hc sinh

theo im tng kt.
char *PL(float d)
{ if (d >= 8.0) return "gioi";
else if (d >= 6.0) return "kha";
else if (d >= 5) return "trung binh";
else if (d < 5) return "kem";
}
Khi dch nhn c cnh bo: Function should return a
value. Cn phi sa li dng lnh cui cng ca hm th
no cho ng?
-- >> (*)[a] else return "kem";
Cu 100 : Hm sau y
char *f(char *s,int k, int n)
{ int i,j=0;
char x[200];
for(i=0;s[i]!="\0";i++)
if((i>=k)&&(j<n)) { x[j]=s[i]; j++; } x[j]="\0";
return x; }
Cho gi tr l:
-- >> (*)[d] Con tr char*, tr xu n k t chp t s, t
v tr k.
Cu 101: Hm sau y d kin dng sp xp cc
{ for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
if (Ds[j] > Ds[i])
{ char s[20];
strcpy(s, Ds[j]);
strcpy(Ds[j], Ds[i]);
strcpy(Ds[i], s);
}
}
-- >> (*)[b] Sai
Cu 102 : Hm sau y d kin dng sp xp cc
{ for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
if (strcmp(Ds[j], Ds[i]) > 0)
{ char s[20];
strcpy(s, Ds[j]);
strcpy(Ds[j], Ds[i]);
strcpy(Ds[i], s);
}
}
-- >> (*)[a] ng
Cu 103: Hai hm sau y dng kim tra xem mt nm
c phi nm nhun hay khng . Nm nhun l nm khng
chn trm c hai s cui chia ht cho 4 hoc nm chn
trm c hai s u chia ht cho 4.
int NN1(int y)
{ if (!(y%400) or ((y%100) && !((y%100)%4))) return 1;
return 0;}
int NN2(int y)
{ if ((y%400) && (!(y%100) or ((y%100)%4))) return 0;
return 1;}
Theo bn: -- >> (*)[c] C hai cng ng
Cu 104 : Hm sau y c chc nng g?

int Sym(char *s)
{ int i = 0, j = strlen(s)-1;
while (i < j)
if (s[i] != s[j]) return 0;
else { i++; j--;}
return 1;
}
-- >> (*)[d] Kim tra mt xu c i xng hay khng
K
Cu 105 : k trong biu thc sau y nhn gi tr l bao
nhiu:
int k = (a > b && c > d);
bit a = 1, b = 2, c = 4, d = 3.
-- >> (*)[a] 0
nhiu:
int k = (a > b or c > d);
bit a = 1, b = 2, c = 4, d = 3.
-- >> (*)[b] 1
nhiu:
int k = (a > b)? 5:8;
bit a = 1, b = 2.
-- >> (*)[b] 8
Cu 108 : Kiu double ca ngn ng Turbo C trn my
PC chim my byte trong b nh?
-- >> (*)[c] 8
Cu 109 : Kiu float ca ngn ng Turbo C trn my
PC chim my byte trong b nh?
-- >> (*)[a] 4
Cu 110 : Kiu int ca ngn ng Turbo C trn my PC
chim my byte trong b nh?
-- >> (*)[c] 2
Cu 111 : Kiu int ca ngn ng Turbo C trn my PC
c min gi tr trong khong no ?
-- >> (*)[d] -32768 n 32767
Cu 112 : Kiu unsigned char ca ngn ng Turbo C
c gi tr trong khong no?
-- >> (*)[b] 0 n 255
Cu 113 : Khi sa on chng trnh dng nhp
mng hai chiu,ngi ta vit li dng lnh sau:
scanf("%d", &A[i][j]);
thnh
scanf("%d", *(A+i)+j);
Sa nh vy ng hay sai?
-- >> (*)[a] ng
Cu 114 : Khi chy on chng trnh sau y th chng

trnh b qun khng thot ra c:
1/ int n = 0, A[1000];
2/ char c;
3/ do {
4/ printf("\nCho mot so nguyen: ");
5/ scanf("%d", &A[n++]);
6/ printf("\nBan co muon nhap nua khong?");
7/ c = getch();
8/ } while (!(c == "c" && c == "C"));
Bn chn cch sa no trong s cc phng n sau:
-- >> (*)[c] dng 8 : } while (!(c == "c" or c == "C"));
Cu 115 : Khi sa on chng trnh dng nhp mng
hai chiu, ngi ta vit li dng lnh sau:
thnh
scanf("%d", A[i]+j);
-- >> (*)[a] ng
Cu 116 : Khi thc hin on lnh sau chng trnh s b
li nhng vn in kt qu x1 v x2.
1| float a = 1.0, b = 2.0, c = 4.0, x1 = 0.0,
2| x2 = 0.0; delta = b*b - 4 * a*c;
3| if (delta < 0.0) printf("\nVo nghiem");
4| else if (fabs(delta) <= 0.0001) x1 = x2 = -b/2/a;
5|
else
6|
x1 = (-b + sqrt(delta))/2/a;
7|
x2 = (-b - sqrt(delta))/2/a;
8| printf("\nx1 = %8.2f, x2 = %8.2f", x1, x2);
Cho bit gi tr x1 v x2 m chng trnh in ra:
-- >> (*)[c] x1 = 0.00, x2 = +NAN
thnh
scanf("%d", (A+i)[j]);
-- >> (*)[b] Sai
thnh
scanf("%d", *(A+i)[j]);
-- >> (*)[b] Sai
thnh
scanf("%d", &(*(A+i))[j]);
-- >> (*)[a] ng
Cu 120 : Khi khai bo mng nh sau:

float mang[n];
th chng trnh dich bo li: Constant expression
expected. Cho bit l do.
-- >> (*)[c] n khng phi hng
Cu 121 : Khi lp trnh nhp mng A ca cc s thc,
Mai vit
for (int i = 0; i < n; i++)
scanf("%f", &A[i]);
}
cn Lan vit
for (int i = 0; i < n; i++)
float a; scanf("%f", &a); A[i] = a;
}
Ai ng, ai sai?
-- >> (*)[a] Lan ng, Mai sai
L
Cu 122 : Lnh clrscr() dng lm g?
-- >> (*)[a] Xo sch mn hnh
Cu 123 : Lnh fflush(stdin) dng lm g?
-- >> (*)[c] Xo sch vng m bn phm ca C
Cu 124 : Lnh in sau y cho kt qu trn mn hnh
nh th no?
printf("\nPI = %8.3f", M_PI);
bit M_PI = 3.1415926.
-- >> (*)[b] 3.142
Cu 125 : Lnh sau y s cho kt qu nh th no trn
mn hnh:
for (int i = 0; i < 5; i++) printf("%*d", i, i);
-- >> (*)[c] 01 2 3 4
M
Cu 126 : M ASCII ca k t "A" vit trong h thp
phn l bao nhiu?
-- >> (*)[b] 65
Cu 127 : Mun dng hm khai cn mt s thc sqrt
phi khai bo tp tiu no?
-- >> (*)[d] math.h
Cu 128 : Mt bin thuc cu trc sau y chim bao
nhiu byte trong b nh:
-- >> (*)[b] 26
Cu 129 : Mt mng ng gm n phn t s nguyn
c cp pht bng lnh sau:
int *m = (int *)malloc(n*sizeof(int));
Nu n = 10 th mng ny chim bao nhiu byte trong
b nh?
-- >> (*)[b] 20 byte
Cu 130 : Mt chng trnh C khi bin dch th b thng
bo li nh sau: Function "sqrt" should have a
prototype.
Hy cho bit nguyn nhn to nn li ny:

-- >> (*)[b] Thiu khai bo #include <math.h>
P
Cu 131 : Phi in t no vo ch chm chm trong
on chng trnh sau y l ng hn c:
char ht[20];
printf("\nHo va ten: ");
......(ht);
printf("\nHo va ten: %s", ht);
-- >> (*)[c] gets
Cu 132 : Sau khi thc hin on chng trnh sau, a c
gi tr l bao nhiu?
i = a = 0;
do { a += ++i;
} while (i <= 8);
-- >> (*)[b] 45
Cu 133 : Sau khi thc hin on chng trnh sau, a c
gi tr l bao nhiu?
i = a = 0;
do { a += i++;
} while (i <= 8);
-- >> (*)[d] 36
Cu 134 : Sau khi thc hin cc lnh sau, bn thy g
trn mn hnh:
clrscr();
textattr(YELLOW + (RED << 4));
cprintf("ESTIH");
-- >> (*)[a] Dng ch ESTIH mu vng trn nn
T
Cu 135 : Toan l thnh phn kiu float ca mt cu trc.
Khi vit chng trnh nhp d liu cho mt mng vi cc
phn t thuc cu trc , H vit:
printf("\nCho im ton: ");
scanf("%f", &H[i].Toan);
v b bo li khi bin dch. l thng bo no trong cc
thng bo sau:
-- >> (*)[c] Floating point formats not linked
Cu 136 : Trong mi trng Turbo C trn my PC, bin
kiu int khc bin kiu char v bn cht im no?
-- >> (*)[c] char chim 1 byte trong b nh, int chim
2 byte
Cu 137 : Trong phn nh ngha hm di y, chng
trnh dch pht hin c li. l li no?
int IsPrime(int n)
{ int i = 2;
while (i*i <= n)
if (!(n%i)) return 0
else i++;
return 1;
}
-- >> (*)[a] Return statement mising ;
Cu 138 : Trong phn nh ngha hm di y,

chng trnh dch pht hin c li. l li no?
int IsPrime(int n)
{ int i = 2;
while (i*i <= n)
if (!(n%i)) return 0;
else i++;
}
-- >> (*)[b] Function should return a value
Cu 139 : Trong on chng trnh sau c mt dng b
li, trong
cn in thm mt k t vo ch c du chm chm:
if (i == 5)
{ k += m + ...;
t *= k;
} else printf("\nKet thuc.");
Chn mt trong cc k t sau in vo ch chm
chm
theo bn sao cho hp l:
-- >> (*)[c] +
Cu 140 : Trong mt chng trnh ca mnh, Hng vit:
void main()
{ int x = 5, A[5];
for (int i = 1; i <= 5; i++)
A[i] = i*100;
printf("\n x = %d", x);
Bn hy cho bit khi chng trnh chy nhng lnh trn,
kt qu m bn thy trn mn hnh l g?
-- >> (*)[c] x = 500
Cu 141 : Trong mt chng trnh ca mnh, Hng vit:
int x = 5, A[5], y = 10;
void main()
{ for (int i = 1; i <= 5; i++)
A[i] = i*100;
printf("\n x = %d, y = %d", x, y);
Bn hy cho bit khi chng trnh chy nhng lnh trn,
kt qu m bn thy trn mn hnh l g?
-- >> (*)[a] x = 5, y = 500
Cu 142 : typedef struct CanBo { char *HoTen; int
NamSinh;};
void Nhap(CanBo *cb)
{ char ht[20];
printf("\nHo va ten : "); gets(ht);
cb->HoTen = (char *)malloc(strlen(ht)+1);
strcpy(cb->Hoten, ht); printf("\nNam sinh : ");
scanf("%d", &cb->NamSinh);
}
Vi cch t chc d liu nh trn th cc bn ghi kiu
CanBo thc t trong khi chng trnh lm vic c
cp pht lng b nh c nh hay khng?
-- >> (*)[b] Tu theo chiu di ca h tn nhp vo
Cu 144 : Xt chng trnh sau y

#include <stdio.h>
void main(){
int i=1;
switch(i) {
case 1: printf("\t%d",i); i+=3;
case 2: printf("\t%d",i); i+=4;
}
printf("\t%d",i); }
Kt qu khi chy chng trnh l:
-- >> (*)[c] 1 4 8
Cu 145 : Xt on trnh o ngc dy n s cho trong
mng x, vi cc cch sau y:
1. for(i=0,j=n-1;i<j;i++,j--){tg=x[i];x[i]=x[j];x[j]=tg;}
2. for(i=0,j=n-1;i<j;tg=x[i],x[i]=x[j],x[j]=tg,i++,j--);
3. i=0;j=n-1;for(;i<j;i++,j--){tg=x[i];x[i]=x[j];x[j]=tg;}
4. for(i=0,j=n-1;;i++,j--){tg=x[i];x[i]=x[j];x[j]=tg;
if(i>j) break;}
5. for(i=0,j=n-1;i<j;)
{tg=x[i];x[i]=x[j];x[j]=tg;i++;j--;}
Cc cch sau y l sai:
-- >> (*)[d] Khng cch no sai
Cu 146 : Xt khai bo sau y:
const m=3,n=4;
float a[m][n];
float *pa=(float*)a;
Khi , phn t hng i, ct j ca mng a c:
1. gi tr l (float*) a + i*n + j
2. a ch l *( (float*) a + i*n + j)
3. gi tr l *(pa+i*n+j)
4. a ch l pa+i*n + j
Cc khng nh sau y l ng:
-- >> (*)[b] 3 v 4
V
Cu 147 : Vi khai bo const m=4,n=5; float a[m][n];
hm main() s gi hm nhp mng a nh sau:
nhapmang((float*)a,m,n);
Hy in vo ch # biu thc ph hp hm nhapmang
ng n:
void nhapmang(float *pa, int m, int n)
{ int i,j;
for(i=0;i<m;i++) for(j=0;j<n;j++)
{ printf("a[%d,%d]=",i,j); scanf("%f", #); }
}
Ti # ta in vo nh sau:
-- >> (*)[b] (pa+i*n+j)
Cu 143 : Xu k t "ESTIH" chim bao nhiu byte trong

b nh? - > (*)[c] 6 byte
CongDongHUBT.VN

Congdonghubt.Vn: Câu Hỏi Và Ñáp Án C++

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Congdonghubt.Vn: Câu Hỏi Và Ñáp Án C++

Enviado por

Direitos autorais:

Formatos disponíveis

CongDongHUBT.

Cu 1 : An vit hm tnh giai tha ca s nguyn dng

Cu 8 : Cho on chng trnh sau

Cu 13 : Cho chng trnh sau:

Cu 18 : Cho bit kt qu ca cc lnh sau:

Cu 28 : Cho on chng trnh sau:

Cu 35 : Cho chng trnh sau:

Cu 41 : Cho on chng trnh sau:

Cu 47 : Cho khai bo sau:

Cu 52 : Cho bit trong chng trnh sau dng no c li

Cu 57 : Cho on chng trnh sau:

Cu 63 : Cho on chng trnh sau:

Cu 75 : Cho on chng trnh sau:

Cu 81 : Cho bit kt qu in ra mn hnh ca chng

Cu 86 : on chng trnh sau th c 2 li. Ch cn

Cu 90 : on chng trnh sau dng in ln mn hnh

Cu 88 : on chng trnh sau y c chc nng

Cu 92 : Gi s cn tnh tng s = 1 +1/2 + 1/3 + 1/4 + ... +

Cu 89 : on chng trnh sau y c chc nng

Cu 93 : Gi s trn a c tp TEST.DAT c dung

Cu 94 : Gi s trn a c tp TEST.DAT c dung

Cu 99 : Hm sau y dng phn loi mt hc sinh

Cu 104 : Hm sau y c chc nng g?

Cu 114 : Khi chy on chng trnh sau y th chng

Cu 120 : Khi khai bo mng nh sau:

Hy cho bit nguyn nhn to nn li ny:

Cu 138 : Trong phn nh ngha hm di y,

Cu 144 : Xt chng trnh sau y

Cu 143 : Xu k t "ESTIH" chim bao nhiu byte trong

Você também pode gostar