VIN IN T VIN THNG

B MN IN T VA K THUT MAY TINH

-------------------------------
MN HC: K THUT VI X L
Hc k: 2 Nm hc: 2013-201
!"I T# V$ NH" %& 3
H'( ()*: Ging ng 205 sng th 3: u bui hc ngy 29/4/2014
Ging ng 205 sng th 4: u bui hc ngy /5/2014
Ging ng !"#40": u bui hc ngy 29/4/2014
(np qua han s nhn dim 0)
Bai 1 (25 dim)
Vit lai ham C sau dy bng hop ngu cho 8086 (tham s cua ham truyn qua stack, gia tri
tra v luu trong thanh ghi chua)
/* Ham tinh s bit 1 cua s nguyn 2 byte */
int Count(int a)
{
int s = 0;
while (a != 0) {
if ((a & 1) != 0)
s++;
a >>= 1;
}
return s;
}
Bai 2 (25 dim)
Vit lai ham C sau dy bng hop ngu cho 8086 (tham s cua ham truyn qua stack,
gia tri tra v luu trong thanh ghi chua)
/* Ham tinh tng cac s chia ht cho 4 cua mang N s nguyn 2 byte */
int Sum(int A[! int ")
{
int s = 0;
for (int i = 0; i # "; i++)
if (A[i $ % == 0)
s += A[i;
return s;
}
Bai 3 (25 dim)
Vit lai ham C sau dy bng hop ngu cho 8086 (tham s cua ham truyn qua stack, gia tri
tra v luu trong thanh ghi chua)
/* Ham tinh tng cac chu s cua mt s cho boi xu ky tu */
int Sum(&har A[)
{
int s = 0;
for (int i = 0; A[i != 0; i++)
s += A[i ' %(;
return s;
}
Bai 4 (25 dim)
t 5 cu hoi trc nghim cho cac ni dung d hoc tu du ky dn tun nay. Mi cu
hoi co 4 phuong an tra loi trong do co 1 dap an dung. Nhp cac cu hoi vao Iorm tai
dia chi va in ra np kem voi cac cu khac:
https://docs.google.com/spreadsheet/viewIorm?
IormkeydFh3MkZacWVTa0tNS0JWcm5QbF94bmc6MA