Bai 1 Hay cho biet gia tr cua bieu thc:

(0x13 || 0x31) && 0x26

a.0
b. 1
c. 0x26
d. 0x31
Bai 2 Hay cho biet gia tr cua bieu thc:
(0x13 & 0x31) | 0x21
a.0x31
b. 0x21
c. 1
d. 0
Bai 3 Bieu thc !((x>y) || (y<=6)) tng ng vi bieu thc
nao di ay?
a. ((x>y) || (y<=6))
b. (x<=y) &&(y>6)
c. (x<=y) || (y>6)
d. !((x>y) &&(y<=6))
Bai 4 Hay cho biet gia tr cua bieu thc:
(13 && 31) || (23 && 32)
a.0
b. 1
c. 736
d. 403
Bai 5 Bieu thc !(a&&b) tng ng vi bieu thc nao di
ay?
a. (a&&b)
b. (a||b)
c. (!a) &&(!b)
d. Khong co bieu thc nao tren la tng ng.
Bai 6
#include<stdio.h>
#include<conio.h>
void doi(int *pa,int *pb);
void main()
{int x=7;
clrscr();
doi(&x,&x);
printf("\nx=%d",x);
getch();
}
void doi(int *pa,int *pb)
{ *pb+=2; *pa+=3;}

Chon ket qua ung:

a.x=12
b. x=9
sai.
Bai 7
#include<stdio.h>
#include<conio.h>
int x=6,y=8;
int sum(int y);
void main()
{
clrscr();
x=sum(x);
y=sum(y);
printf("%5d%5d",x,y);
getch();

c. x=10

d. Ca ba cau eu

}
int sum(int y)
{
y+=2;
return (x+y);
}

Chon ket qua ung:

a.8 10
b.14 24
c.14 16
d. 8 16
Bai 8
#include<stdio.h>
#include<conio.h>
int x=2,y=7;
int p(int x,int y);
void main()
{
clrscr();
x=p(y,x);
y=p(x,y);
printf("%5d%5d",x,y);
getch();
}
int p(int x,int y)
{
x=y+2; y*=x;
return ((x+y)/2);
}

Chon ket qua ung:

a.6
27
b.36 6
c.6
36
d. Ca ba cau eu sai.
Bai 9
#include<stdio.h>
#include<conio.h>
void doi(int *pa,int b);
void main()
{
int x=5;
clrscr();
doi(&x,x);
printf("\nx=%d",x);
getch();
}
void doi(int *pa,int b)
{
b+=2;
*pa+=5;
}

Chon ket qua ung cua chng trnh tren:

a. x=7
b. x=12
c. x=10
d. ca 3 cau tren deu sai.
Bai 10
#include<stdio.h>

#include<conio.h>
int cong(int x);
void tru(int x,int *py);
void main()
{
int x=5,y=8;
clrscr();
tru(x,&y);
cong(y);
printf("%5d%5d",x,y);
getch();
}
int cong(int x)
{
x=x+1;
return (x);
}
void tru(int x, int *py)
{x=x-1;
*py=cong(x+*py);}

Chon ket qua ung cua chng trnh tren:

a. 5 13
b. 5 14
c. 4 13
d. 4 14
Bai 11
#include<stdio.h>
#include<conio.h>
int x=5;
void tt1(int *px);
void tt2(int *py);
void main()
{clrscr();
tt1(&x);
tt2(&x);
printf("%5d",x);
getch();
}
void tt1(int *px)
{ *px+=5;}
void tt2(int *py)
{x=*py; tt1(&x);}

Chon ket qua ung cua chng trnh tren:

a. 10
b. 15
c. 20
d. ca ba deu sai.
Bai 12
#include<stdio.h>
#include<conio.h>
int x=7,y=9;
void doi(int *pa,int b);
void main()
{clrscr();
doi(&y,x);
printf("%5d%5d",x,y);
getch();
}

void doi(int *pa,int b)

{ *pa=*pa+b;
b=*pa-b;
*pa=*pa-b;
}

Chon ket qua ung cua chng trnh tren:

a. 9 9
b. 7 7
c. 7 9
d. 9 7
Bai 13
#include<stdio.h>
#include<conio.h>
void tt(int *pa,int b, int c, int d);
void main()
{int x=2,y=3,z=4,t=5;
clrscr();
tt(&x,y,z,t);
printf("%5d%5d%5d%5d",x,y,z,t);
getch();}
void tt(int *pa,int b, int c, int d)
{ int tam;
tam=*pa;*pa=b;b=tam;
tam=c; c=d; d=tam;
}

Chon ket qua ung cua chng trnh tren:

a.3 3
4
5
b. 2 3
4
5
c. 3 2
4
5
d. 3 2
5
4
Bai 14
#include<stdio.h>
#include<conio.h>
int maxval(const int x[]);
void main()
{int x[]={0,-3,4,8,10};
clrscr();
printf("%5d",maxval(x));
getch();}
int maxval(const int x[])
{int i,mv=x[4];
for (i=0;i<5;i++)
if(x[i]>mv) mv=x[i];
return(mv);}

Chon ket qua ung cua chng trnh tren:

a.0
b.10
c.8
d. -3
Bai 15 Xet ham sau:
int tim_mang(const int a[], int n, int val )
{
int tmp=0;
int k;
for (k=n-1;k>=0;k--)
tmp=(a[k]==val);
return (tmp);
}

Phat bieu nao mo ta ung ieu kien ma vi ieu kien

o ham tim_mang tra ve 1?
a. Khi ch co ung mot phan t cua mang a cha tr val
b. Khi phan t au tien cua mang a cha tr val
c. Khi phan t cuoi cung cua mang a cha tr val
d. Khi mang a cha tr val
Bai 16 Ham di ay co muc ch tra ve 1 neu va ch
neu gia tr c cho trong bien key co nam trong mang. Tuy
nhien ham nay khong c viet ung. (So dong nh kem
ch e tham khao):
1.
2.
3.
4.
5.
6.

int search(const int a[], int n, int key)

{ int k=0;
while ((k<n)&&(a[k]!=key)) k++;
if (a[k]==key) return 1;
return 0;
}

a. Viec kiem tra a[k]= = key dong 4 se gay ra loi thi

hanh(runtime error) bat c khi nao ham c goi vi mang
cha gia tr key.
b. Viec kiem tra a[k]! = key dong 3 se gay ra loi thi
hanh(runtime error) bat c khi nao ham c goi vi mang
khong cha gia tr key.
c. Viec kiem tra a[k]= = key dong 4 se gay ra loi thi
hanh(runtime error) bat c khi nao ham c goi vi mang
khong cha gia tr key.
d. Viec kiem tra a[k]! = key dong 3 se gay ra loi thi
hanh(runtime error) bat c khi nao ham c goi vi mang
co cha gia tr key.
Bai 17 Xet ham sau:
void
{
int
for
for
}

a
a
a
a

lmatran(char m[][5], int dong, int cot)

k;
(k=0;k<cot;k++) m[dong-1][k]=X;
(k=0;k<dong;k++) m[k][0]=X;

Gia thiet rang m la mot ma tran 3 dong 5 cot gom cac ky

t a c khi tao ve cac khoang trang. Hnh nao di
ay mo ta gia tr cua m sau khi goi lmatran(m, 3, 5)?
a.
X
X
X
X
X
X
X
X
X
X
X
X
b.
X
X
X

c.
X
X
X
d.
X
X
X
X
X
X
Bai 18 Xet ham

X
X
X
X
sau:

void tinh(int x, int y, int z)

{if (x==0)
if (y==0) z+=4;
else z+=2;
return z;
}

Ga tr nao c tra ve neu goi tinh(0,1,0)?

a. 2
b. 4
c. 6
d. tat ca eu sai
Bai 19 Xet ham sau:
int ham(const int a[], int n)
{int k;
for(k=1;k<n;k++)
if(a[k-1]>=a[k]) return 0;
return 1;
}

Phat bieu nao di ay mo ta ung nhat chc nang cua

ham tren?
a. Tra ve 1 neu va ch neu mang a sap xep theo th t
giam dan nghiem cach
b. Tra ve 1 neu va ch neu mang a sap xep theo th t
tang dan nghiem cach
c. Tra ve 1 neu va ch neu mang a cha cac gia tr trung
lap
d. tat ca eu sai
Bai 20 Xet nhng ham sau:
void sua(int *x)
{ int y=*x;
(*x)++;
printf(%d%d ,*x,y)
}
void hm1(int y)
{ printf(%d,y);
sua(&y);
printf(%d,y);
}
void bdau()

int x=1;
hm1(x);
printf( %d\n,x);

Ket xuat se nh the nao khi goi ham bdau?

a.1 2
1 2
1
b.0
1 0
1
0
c.1
2 2
2
1
d.1
0 0
0
1
Bai 21 Xet nhng ham sau:
void sua(int x, int *y, int *z)
{

x=*y;
*y=*z;
*z=x;

}
void ham(int int a, int b, int c)
{ sua(a,&c,&b);
printf(%d%d%d\n,a,b,c);
}

Ket xuat la gi neu goi ham(3,2,1)?

a.3
2
1
b.3
1
2
c.1
2
3
d.2
1
3
Bai 22 Xet nhng ham sau:
int ham(int k)
{ if (k==1) return 0;
else return (1+ham(k/2));
}

Ket xuat la gi neu goi ham(16)?

a.8
b.16
c.0
d.4
Bai 23 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int x=5,y=6,z=3,t=9;
if (x>=y)
if (y>=z) t=y+2;
else t=x-2;
printf(%5d,t+2);
}

Ket qua ung:

a. 5
b. 10
c.11
d.Ca ba cau tren eu
sai.
Bai 24 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int x=11,y=6,z=3;
if (x>y)
if (y>z) x=x+3;

else x=x-3;
printf(%5d,x+1); }

Ket qua ung:

a.15
b. 9
c.12
d.Ca ba cau tren eu sai
Bai 25 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int i,s,t,z;
z=5;
s=1;t=1;
for (i=1;i<=z;i++)
{s=s+t;
t=-2*t;
}
printf(%5d,s+1);
}

Ket qua ung:

a. 12
b. 13
c.15
d.Ca ba cau tren eu sai
Bai 26 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int x=1,y;
while (x<7)
{y=2;
while (y<15)
{y+=2; printf(%5d,y*x+2);}
x+=2;
}
}

Ket xuat cuoi cung cua oan chng trnh tren c in ra la:
a. 62
b. 72
c.82
d.92
Bai 27 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int x=5,y=1,z=3;
while (x>y)
{while (y>z) z +=1;
y+=2;
}
printf(%5d%5d%5d,x+1,y,z);
}

Ket qua ung c in ra la:

a. 6 5 4
b. 5 5
3
c.6
5
3
d.Ca ba
cau tren eu sai
Bai 28 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{
int x=3,y=5,z=4;
do

{do {z+=2;} while (z<=y);

y+=2;}while (y<=x);
printf(%5d%5d%5d x+1,y,z);
}

Ket qua ung c in ra la:

a. 4 7 6
b. 4 5 4
c.4 7 4 d.Ca ba cau eu
sai
Bai 29 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int n=3;
do
{n+=2;
printf(%5d,n);
n+=1;
}while(n<15);
}

Ket xuat au tien va cuoi cung c in ra la:

a. 3 14
b. 5 14
c.7 15
d.Ca ba cau tren eu sai.
Bai 30 Chon ket qua ung cua oan chng trnh sau:
#include<stdio.h>
void main()
{int a,b=3;
switch((a=2)?6:4)
{case 6:b+=2;
default:a-b--;
case 4:a--; }
printf(%d%d,a,--b);
}

Ket qua in ra la:

a. 3 4
b. 3 3

c.1 3

d.1 1