Experiment and Exercise Scenario

CN CNTT

Autor : V c Vng

Course Title: Programming Technique

Semester : 04
Product Code: IT3540

1/9

Experiment and Exercise Scenario

CN CNTT

Semester: 4
Course Title: Programming Technique
Week: 5+6st
Theme: Basics of C,C++
No. L thuyt
Thc hnh
1
Th t thc 1.1 Vit chng trnh nhp cc tham s tng ng v tnh gi tr cc biu thc sau :
int a,b,c,d;
hin cc php
a=b=c++=d=10;
ton trong C

in ra a,b,c,d
a=b=++c=d=10;
in ra a,b,c,d
Gi nguyn on code trn, sa dng khai bo thnh int a,c,d,b; chy chng trnh v xem kt qu
v a ra nhn xt
1.2 Vit chng trnh nhp cc tham s tng ng v tnh gi tr cc biu thc sau :
Int a,b
Nhp a
b= a++ + 2 * a;
in ra a,b
b= ++a + 2 * a;
in ra a,b
b= (2*a)+ ++a;
in ra a,b
b= (2*a)+ a++;
in ra a,b
b= ++a + (2*a);
in ra a,b
b= a++ + (2*a);
a=10;
printf(" \n a++,a = %d, %d",a++,a);
a=10;
printf(" \n ++a,a = %d, %d",++a,a);
a=10;
printf(" \n a,a++ = %d, %d",a,a++);

2/9

Experiment and Exercise Scenario

CN CNTT
a=10;
printf(" \n a,++a = %d, %d",a,++a);

Chy chng trnh trn TURBO C++, VC++ v GCC, xem kt qu v a ra nhn xt v th t thc
hin cc php ton, cng c ch truyn tham s cho hm ca C

Array

Pointer

2.1 Vit CT nhp vo 1 xu k t va in ra s ln xut hin ca mi k t trong xu. Nhp vo 2 k t

ri in ra xu vi k t th nht ( nu c) trong xu c thay th bng k t th 2.Trnh by gii php
2.2 Vit chng trnh tnh tng 2 ma trn
2.3 Vit chng trnh tnh tch 2 ma trn
3.1 Chp chng trnh sau, chy, xem kt qu ri tm v chnh sa li :
#include <stdio.h>
#include <conio.h>
void main(){
int a,b,c;
int *p=&c;
c = 3;
/* divide c by itself */
a = c/*p;
b = c
/* set b to 3 */ ;
printf("a=%d, b=%d, c=%d\n", a,b,c);
getch();
}

Functions

XD hm tnh cn bc ba ca 1 s thc, ri nhp dy cc s thc x1, x2, ..., xn v tnh

tng :

Bit rng :

3/9

Experiment and Exercise Scenario

CN CNTT

Pointer
v 4.1 Vit li chng trnh 2.2,2.3 dng cp pht b nh ng ( s dng mng 1 chiu, v 2 chiu)
cp pht b
4.2 Viet CT nhap vao danh sach ho va ten sv cua 1 lop, roi in ra ds theo thu tu kieu vietnam, voi yeu cau
nh ng
tiet kiem bo nho toi da

Semester: 4
Course Title: Programming Technique
Week: 7+8+ 9+10nd
Theme: Advanced C,C++
No. L thuyt
6
Overloading Operator

Thc hnh
6.1 Xy dng cu trc phn s , hm tin ch xc lp phn s ( setpPS(int,int), hm ti gin phn
s, v a nng ha cc ton t +,-,*,/, ++,-6.2 p dng cu trc phn s cung cc hm va ton t trn, v it chng trnh nhp cc phn s
p1,p2,p3 v s nguyn a,b ri tnh v in ra gi tr cc biu thc sau :
b= a++ + 2 * a;
b= ++a + 2 * a;
b= (2*a)+ ++a;
b= (2*a)+ a++;
b= ++a + (2*a);
p2= p1++ + (2*p1);
p2= p1++ + 2 * p1;

4/9

Experiment and Exercise Scenario

CN CNTT

p2= ++p1 + 2 * p1;

p2= (2*p1)+ ++p1;
p2= (2*p1)+ p1++;
p2= ++p1 + (2*p1);
p2= p1++ + (2*p1);
Chy chng trnh trn TURBO C++, xem kt qu v a ra nhn xt cch thc hin php ton ++,
-- ca trnh dch, v so snh vi cch thc thc hin ca ton t ++,-- do ta nh ngha ! ( De de dang
so sanh ket qua, hay nhap a=1 va p1=(1/1) . Sv can lien he voi bang thu tu thuc hien cac phep toan,
va dua ra nhan xet ve cach thuc cai dat bieu thuc cua trinh dich tuong ung !!!)
(Lin h vi bi 1.2 !!!)
6.3 Xay dungcau truc Time va da nang hoa cac toan tu can thiet

Array + overloading operator

7.1 xy dng cu trc matrix vi cc trng kiu nguyn R v C xc nh s hng v s ct ca

ma trn, trng float ** data cp pht b nh ng dng mng hai chiu. V dnh ngha cc php
ton +, * cng v nhn 2 ma trn
** sau khi ci t xong cc php ton, hy khai bo cc matran a,b,c,d tng ng v thc hin biu
thc a=b+c; in ra a, d=b*c; in ra d;
Sau do cho a=b+c; v d=b*c; 2000 ln ( lp); ri in kt qu a,d v so snh vi cc kt qu trn !!
( v nguyn tc th a v d phi khng i, v b,c khng i th chy bao nhiu ln, kt qu vn khng
thay i, nhng thc t ???, hy tm hiu nguyn nhn ti sao !!! )

Array and Pointer

8.1 Chp chng trnh sau, chy, xem kt qu v gii thch nhng im bt thng trong chng
trnh :
#include <stdio.h>
#include <conio.h>
#include <string.h>
void main(){
int i,m[5];
char x1[10],x2[10];
char *s1,*s2;

5/9

Experiment and Exercise Scenario

CN CNTT
for (i=1; i<7;i++) i[m] =i*2;
for (i=1;i<7;i++) printf(\n m[%d] = %d,i,m[i]);
s1= new char[10];
s2= new char[10];
strcpy(s2, xau 2);
strcpy(s1,Dai hoc bach khoa ha noi);
printf(\n s1= %s,s1);
printf(\n s2= %s,s2);
strcpy(x2, xau x2);
strcpy(x1,Dai hoc bach khoa ha noi);
printf(\n x1= %s,x1);
printf(\n x2= %s,x2);
}

10

Recursive De qui

getch();

( Luu y ve pham vi cua mang, cach su dung i[m]=, giai thich tai sao ket qua doi voi mang m van
dung va chi ra duoc nguy co tiem an. So sanh s1,s2 voi x1,x2, giai thich co che thuc hien !)
9.1 Vit hm qui tnh tng cc ch s chn( l) ca s nguy n dng n
9.2 Vit Hm qui i 1 s nguyn dng thp phn sang 1 c s bt k (2,8,16)
9.3Tnh S(n) = s qrt(1 + s qrt(2 + sqrt (3 + ...s qrt (n-1 + sqrt (n)))))
9.4 Tnh S(n) = 1/2 + 3/4 + 5/6 + 7/8 +9/10 + .....
9.5* Cho hai dy s X v Y vi :
X ={ 1, 4, 12,56, 880, .... }
Y ={ 1, 2, 16,384,43008, .}
Hy vit cac ham qui tnh X,Y roi tinh tng :
S(n) = X(1)+X(2) + X(n) +Y(1)+Y(2)+ .. + Y(n)
9.6 * Cho hai dy s X v Y vi :
X ={ 1,2, 3,6, 11,20,37, .... }
Y ={ 1,2, -1,0,9,57,183, .}
Hy vit cac ham qui tnh X,Y roi tinh tng :
S(n) = X(1)+X(2) + X(n) +Y(1)+Y(2)+ .. + Y(n)
Cc bi tp trong slide chng IV, phn qui : Luu y : 1 so giai thuat cai dat trong slide tren lop co
nhung sai sot, khi thuc hien cac bai tap nay, sv can chi ra nhung diem sai sot trong cacgiai thuat do !

6/9

Experiment and Exercise Scenario

CN CNTT

11

Programming Style

11.1 Ap dung cac ky thuat phan tich, thiet ke va cai dat cung phong cach lap trinh
trong vi du Text formatting. Tien hanh phan tich thiet ke va cai dat bai toan sau :
Cho mot xau ky tu gom day cac so co 3 chu so co dang nhu sau :
101,102,103,104,201,202,205,206,207,208,209,210,212,215,301,302,303,304,305
,401,403. ( do dai tuy y)
Hay to chuc lai de in ra ket qua tren nhieu dong, moi dong khong qua 30 ky tu. Noi
dung moi dong co dang nhu sau :
101-104,201,202,205-210,212,215
301-305,401,403 .
(tuc la neu day cac so lien tuc gom nhieu hon 3 so thi dua ve dang somin-somax)
Tu nay ve sau : cac bai tap (ke ca bai thi-kiem tra) phai tien hanh theo trinh tu :
+Dua ra bai toan
+Phan tich cac yeu cau
+Thiet ke so bo (pseudocode)
+Cai dat ( dua ra Ct nguon cuoi cung, cac buoc phan tich,trien khai chi tiet
step by step co the bo qua) Dong thoi phai ap dung moi ky thuat, phong
cach nhu da hoc trong chuong III

11.2 M rng BT trn : Bi ton tnh tin phng ks : tnh tin phng cho 1 on
khch ti khch sn, t thc t s dng phng ca khch ngi ta trch rt t CSDL
ra cc thng tin cn thit v lu vo mng vi cc thng tin nh sau :

7/9

Experiment and Exercise Scenario

CN CNTT
Thi gian
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
01/01/2007 05/01/2007
07/01/2007 09/01/2007
07/01/2007 09/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
07/01/2007 10/01/2007
09/01/2007 10/01/2007
09/01/2007 10/01/2007

S ngi
1
1
1
1
2
2
2
2
2
2
1
2
1
1
1
2
2
2
2
2
1
2

S phng
105
106
107
109
101
302
205
206
207
208
104
304
105
106
107
305
306
307
308
401
201
406

Gi tin
45
45
45
45
45
45
55
55
55
55
45
55
45
45
45
55
55
55
55
55
45
55

S ngy
4
4
4
4
4
4
4
4
4
4
2
2
3
3
3
3
3
3
3
3
1
1

T kt qu dng nh trn, ngi ta phi a ra kt qu di dng sau :

Thi gian
Din gii
Thnh tin
01/01/2007 05/01/2007
105-107,109,(1K),101,102,(2K) : 45 usd x 4
900
Dx6R
205-208,(2K) : 55 usd x 4 D x 4 R
880
07/01/2007 09/01/2207
104,(1K) : 45 usd x 2 D x 1 R
90
304 (2K) : 55 usd x 2 D x 1 R
110
07/01/2007 10/01/2007
105-107,(1K) 45 usd x 3 D x 3 R
405
305-308,401,(2K) 55 usd x 3 D x 5 R
825
09/01/2007 10/01/2007
201,(1K) : 45 usd x 1 D x 1 R
45
406,(2K) : 55 usd x 1 D x 1 R
55
8/9

Experiment and Exercise Scenario

CN CNTT

9/9