1

Trng Cao ng K Thut Cao Thng

Khoa in t Tin hc













1. Vi cc khai bo sau, th lnh no di y l sai ?
const n=2009;
int x=7, y=3;
a. x = y/2; b. y = n+1;
c. x = x+ 3; d. n = x;

2. Cho bit on chng trnh sau khi thi hnh in ra
mn hnh kt qu g :
#include<iostream.h>
void main()
{
int x = 20000, y = 18000, t ;
t = x + y - 10000;
cout<< t;
}
a. 32768 b. 28000
c. Khng in g c d. Tt c u sai.

3. Trong cc biu thc sau, biu thc no l ng :
a. 4 = x + y b. x => y+2
c. x =< y-1 d. x+y != 3

4. Cho bit kt qu ca chng trnh sau :
N = 248;
a = N / 10/10;
b = N % 100 / 10;
c = N % 100 % 10;
cout<< b*100+c*10+a;
a. 824 b. 482 c. 248 d. Tt c u sai.

5. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
float kq=0;
int a = 3, b = 2;
kq = a/b;
cout<<kq;
}
a. 2 b. 1.5 c. 1 d. Tt c u sai.

6. Cho x,y l 2 s thc, lnh no sau y in gi tr
ca 2 s x, y ra mn hnh :
a. cout<< " Hai so la : x, y";
b. cout<< "Hai so la : "<< x << y;
c. cout<< "Hai so la : "<< x + y;
d. cout<< " Hai so la : " << x, y;

7. Cho bit cu lnh no s b bo li trong on
chng trnh sau :
#include <iostream.h>
void main()
{
(1) int x, y;
(2) cout<<" Nhap vao 2 so nguyen x,y : ";
(3) cin >>x>>y;
(4) t = x+y;
(5) cout <<" Tong cua 2 so nguyen x,y la t ";
}
a. (2) b. (3)
c. (4) d. Tt c u sai

THI HC K PH NM 2010
MN : NGN NG LP TRNH
LP: CN08
THI GIAN : 60 pht

2
Lu :
- Khng c s dng ti liu.
- nh du vo bng tr li, khng nh du vo thi.
- Np li c thi v p n sau khi lm bi xong.
H TN :
LP :
2
8. tnh gi tr
a
b
x
2

th chn cu lnh no :
a. x= -b/2a; b. x = -b/2/a;
b. c.
a
b
x
2

; d. x = -b/2*a;

9. Lnh no sau y in ra s nh nht gia X v Y :
a. if (X < Y) cin>>Y; else cin>>X;
b. if (X > Y) cout<< X; else cout<<Y;
c. if (X > Y) cout<< Y; else cout<<X;
d. if (X < Y) cin>>X; else cin>>Y;

10. Cho bit trong cc lnh di y, lnh no nm
trong th vin conio.h :
a. printf b. sqrt
c. textbackground d. cout

11. Hm no sau y ly tr tuyt i ca 1 s thc :
a. fabs b. exp
c. sqrt d. abs

12. Cho khai bo sau:
int m, n; float p, q;
th lnh no di y sai ?
a. m = p + q b. p = (m+n)%2
c. q = m n d. n = p % m

13. Cho bit gi tr ca k sau on chng trnh:
int n=5, m=n/2, p=1, k=0;
if (n>=m+p)
if (m+p % 2 != 0)
k= n-p ;
else k=m+p;
a. 0 b. 3 c. 4 d. 5

14. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int a=1;
switch (a)
{ case 1 : a=a+2;
case 2 : a=a/2;
default : a=a*2;
}
cout<<a;
}
a. 1 b. 2
c. 3 d. Chng trnh c li
15. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int s;
s = 4/8;
if (s ==0) cout << "khong";
else if (s==1) cout<< "mot";
else cout << "hai";
}
a. khong b. mot
c. hai d. Khng in g c.

16. Cho bit gi tr ca a v b sau khi thi hnh
chng trnh sau:
void main( )

int a = 7, b = 8, c ;
c = (a + b) / 2;
if ( b = = c)

a = a + 1;
b = b + 2;

else

a = a 1;
b = b 2;


a. a = 6, b = 6 b. a = 7, b = 7
c. a = 8, b = 9 d. a = 8, b = 10

17. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int a=2, b=4;
if (a<b)
a = a + 1;
else
b = b 1;
a = a + b;
cout<< a;
}
a. 3 b. 5 c. 7 d. 8

3
18. Lnh dng xa mn hnh l:
a. clrscr(); b. clrcsr();
c. clrscl(); d. clrsrc();

19. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int a = 7, b = 5, c = 3, x;
x = a;
if (b > x)
x = b;
if (c > x)
x = c;
cout<< x;
}
a. 3 b. 5
c. 7 d. Tt c u sai.

20. Cho bit gi tr ca t sau khi thc hin on
chng trnh:
int t=0, a=1, b=0, c=4, d=7;
if (a%2!=1) t=t+1;
if (b%2!=1) t=t+1;
if (c%2!=1) t=t+1;
if (d%2!=1) t=t+1;
cout<<t;
a. 1 b. 2 c. 3 d. 4

21. Cho bit kt qu ca on chng trnh sau :
#include <iostream.h>
#include <math.h>
void main()
{
int n=5, s=0;
for (int i=0; i<n; i++)
s = s + pow(i,2);
cout<<s;
}
a. 0 b. 15 c. 30 d. 55

22. Cho bit gi tr s, t sau on lnh ny:
int i,n=10,s=0,t=0;
for(i=1; i<=n; i++)
s++;
t++;
a. s=10, t=10 b. s=10, t=1
c. s=1, t=10 d. s=1, t=1
23. Cho bit gi tr s sau on lnh ny:
int i, n=3, s=0;
for(i=1; i<=n; i++) ;
s++;
a. 0 b. 1 c. 3 d. 6

24. Cho bit gi tr cui cng ca N sau on lnh:
N=0;
while(N<20)
{
cout<<N;
N=N+1;
}
a. 19 b. 20 c. 21 d. Tt c u sai.

25. Cho bit vng lp sau s lp bao nhiu ln?
for ( int count = 0; count <=10; count ++)
< cng vic > ;
a. 9 b. 10 c. 11 d. v hn

26. Cho bit kt qu xut ra mn hnh:
int N=10;
do
{
N=N+2;
cout<<N;
N=N+1;
}
while(N<=16);
a. 10 15 b. 10 15 18
c. 12 15 d. 12 15 18

27. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int n = 4, t=0;
for (int i=0; i<n; i++) t=t+2;
cout << " t= "<< t;
}
a. t= 0 b. t=2 c. t= 8 d. t=10

28. Cch khai bo mng 1 chiu no sau y l ng?
a. int a[];
b. int N=100, c[N];
c. const N= 100; int b[N];
d. Tt c u sai.
4
29. Cho bit cu lnh no s bi bo li trong on
chng trnh sau :
#include <iostream.h>
void main ()
{
(1) int a[20];
(2) for ( int i=0; i<20; i++)
{
(3) cout << "Nhap vao phan tu thu"<< i;
(4) cin>> &a[i];
}
}
a. (1) b. (2) c. (3) d. (4)

30. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
#include <conio.h>
void main()
{
int a[]={5, 4, 13, 1, 8, 2};
for (int i=0; i<5; i++)
for (int j=i+1; j<6; j++)
if (a[i]>a[j])
{
int t=a[i];
a[i]=a[j];
a[j]=t;
}
cout<<a[5];
getch();
}
a. 1 b. 2 c. 8 d. 13

31. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
const n=5;
void main()
{
int k=0, d=0;
int a[]={4, 2, 4, 19, 7};
for (int i=0; i<5; i++)
{
d=0;
for (int j=1; j<=a[i]; j++)
if (a[i]%j==0) d++;
if (d==2) k++;
}
cout<<k;
}
a. 2 b. 3 c. 4 d. 7
32. Vi mng: 3 8 4 7 2 3
Cho bit kt qu tr v ca hm sau :
int Tim(int a[], int n)
{
for (int i=0;i<n; i++)
if (a[i]%2 ==0 && i %2==0) return a[i];
return -1;
}
a. -1 b. 2 c. 4 d. 8

33. Cho bit kt qu ca mng a sau khi p dng
hm sau:
void ThucHien(int a[], int n)
{
for (int i=0; i<n; i++)
{
int tam=a[i];
a[i] = a[n-1-i];
a[n-1-i]=tam;
}
}
a. Khng thay i.
b. B o ngc.
c. Sp xp theo th t tng dn.
d. Sp xp theo th t gim dn.

34. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int d=0, n=16;
for (int i=1; i<n; i++)
if (n%i==0)
d++;
cout<<d;
}
a. 0 b . 1
c. 5 d. Tt c u sai

35. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void main()
{
int d=0; int a[]={3, 5, 8, 1, 7, 2};
for (int i=0; i<6; i++)
if (a[i]%2!=0) d++;
cout<<d;
}
a. 1 b. 2 c. 3 d. 4

5
36. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
int tinh(int x, int &y, int &z)
{
x=x+1;
y=y+2;
z=z+3;
return x+y+z;
}
void main()
{
int a=2,b=1,c=2;
int s=tinh(a,b,c);
s=s+a+b+c;
cout<<s;
}
a. 14 b. 17
c. 18 d. 21

37. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
int Cong (float a)
{
return int(a+0.3);
}
void main()
{
cout<<Cong (4.6);
}
a. 4 b. 4.9
c. 5 d. Tt c u sai.

38. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
int Test(int n)
{
for (int i=2; i<n; i++)
if (n %i==0)
return 0;
return 1;
}
void main()
{
cout<< Test(105);
}
a. 0 b. 1
c. 2 d. Chng trnh bo li



39. Cho bit kt qu ca chng trnh sau:
#include <iostream.h>
void Nhan(int a)
{
a=a*5;
}
void main()
{
int x=1;
Nhan(x);
cout<<x;
}
a. 1 b. 5
c. 10 d. Tt c u sai

40. Vi x = 1, y = 8, cho bit kt qu ca x, y sau khi
thc hin hm sau:
void A (int x, int &y)
{
int t = x;
x = y;
y = t;
}
a. x = 1, y = 1 b. x = 8, y = 8
c. x = 1, y = 8 d. x = 8, y = 1

---Ht---


Gio vin ra






Nguyn V Cng Khanh