Vu Duc Vuong - SOICT-HUT: De Thi KTLT K53 - 2010

http://vuducvuong-soict-hut.blogspot.com/2010/12/de-thi-ktlt-k53-2010...

Chia s

Bo co Lm dng

Blog Tip theo

To Blog

ng nhp

Vu Duc Vuong SOICT-HUT

Tm kim
TH SU, NGY 17 THNG MI HAI NM 2010

De Thi KTLT K53 - 2010

thi So 1
Mn : K thut lp trnh (IT3040) Thi gian: 90 pht SV c php s dng ti liu , nhng cm tuyt i : trao i ti liu, dng my tnh, in thoi d

Cu 6: (1) Tinh chnh nng cao hiu nng ca Cu 1 : (0.75) Cho bit hm sau y lm g : chng trnh sau void bitchange(int &x, int n) { x &= ~(1 << (n - 1)); void my_func(float val, float *a, int n){ } int i=0,found = 0; Cu 2 : (0.75) Hy tin hnh Test v chnh sa while ((!found) && (i<n)) { on m sau : float testval = log(val)/log(2); if (a[i] == testval) found = 1; void process_data(char *s) { else i++; char cDest[32]; } strcpy(cDest,s); if (found) do_something; /* use cDest } ... */ } Cu 3 : (1) Mt LTV vit v cho chy CT sau : Cu 7: (3.5) Cho cu trc d liu qun l sinh vin nh sau : struct sinhvien { #include <stdio.h> struct hoso { char malop[6]; void main(){ char hovaten[35]; int a,b,c=3; long sohieusv; float kqht; } data; int *p = &c; struct sinhvien *next; } *ds; /* divide c by itself */ D liu c nhp.Hy vit cc hm cn thit Sp xp danh sch sinh vin theo lp , trong 1 lp theo a = c/*p; th t ABC ca tn, h v tn m (Yu cu : Tun th

1 of 5

05/09/2012 09:49 AM

Vu Duc Vuong - SOICT-HUT: De Thi KTLT K53 - 2010

http://vuducvuong-soict-hut.blogspot.com/2010/12/de-thi-ktlt-k53-2010...

b = c /* set b to 3 */; printf("a=%d, b=%d\n", a,b); } Khi thc hin , kt qu khng nh mun(a=1 b=3).Hy tin hnh test v g ri CT. a- cu 4 : (0.75) Ti u on code sau : float f(float *a, float *b, int n) { float ta, tb , sum = 0.0; int i = 0; ta = a[i]; tb = b[i]; for (i = 1; i < n; i++) { sum += ta + tb; ta = a[i]; tb = b[i]; } sum += ta + tb; return sum; } Cu 5 : (0.75) Cho bit ngha ca hm sau : void sw(int *a, int *b) { *a ^=*b; *b ^=*a; *a ^=*b; }

cc yu cu v phong cch lp trnh, thit k topdown v cc k thut Lt hiu qu)

Cu 8: (1.5) Vi t la i oa n chng trnh sau c kt qu tng ng m khng dung RETURN MainProgram ( thc ch t la lnh Goto ) vi hm swap chun : typedef int mang[MAX]; void Sort1(mang &A, int n) { int i,j; int doicho; for (i=0;i<n;i++) { doicho = 0; for (j=n-1;j>0;j--) if (A[j] < A[j-1]) { swap (A[j], A[j-1]); doicho++; } if (doicho == 0) RETURN MainProgram; } }

thi so 2
Mn : K thut lp trnh (IT3040) Thi gian: 90 pht SV c php s dng ti liu , nhng cm tuyt i : trao i ti liu, dng my tnh, in thoi d Cu 1: (1) Mt LTV vit CT nh sau : #include <stdio.h> void main(){ int a,b=3,c=6; int *p = &b; /* chia c cho b */ a = c/*p; b = c ; /* gan b = 6 */ printf("a=%d, b=%d\n", a,b); Cu 6 : (1) Tinh chnh nng cao hiu nng ca chng trnh sau void F1(float b, float *a, int n) { int i=0, found = 0; while ((!found) && (i<n)) { float x = log(b)/log(2); if (a[i] == x) found = 1; else i++; } if (found) do_something; } Cu 7 : (3.5) Cho cu trc d liu qun l sinh vin nh sau : struct sinhvien { struct hoso {

2 of 5

05/09/2012 09:49 AM

Vu Duc Vuong - SOICT-HUT: De Thi KTLT K53 - 2010

http://vuducvuong-soict-hut.blogspot.com/2010/12/de-thi-ktlt-k53-2010...

char malop[6]; char hovaten[35]; long sohieusv; Khi dch c li c php, LTV sa = cch thm float kqht; } data; du ; vo trc lnh printf, nhng run th kt qu struct sinhvien *next; khng nh .Hy ch ra li c php, sau tin } *ds; hnh test v g ri CT sa li c php ca LTV D liu c nhp v c sp xp theo theo lp , c kq l a= 2 v b=6. trong 1 lp theo th t ABC ca tn, h v tn m. Cu 2 : (0.75) Cho bit kt qu hin ra trn mn hnh khi thc Hy vit hm Search vi cc tham s truyn vo l hin chng trnh di y. Hy gii thch chi t v sao li c MaLop v HoVaTen v cc hm cn thit khc tm kt qu nh vy? #include <stdio.h> kim v nhanh chng xc nh c tn ti h s int F(int *x) { tng ng hay khng, nu c th in ra sohieusv v *x +=1; return *x; kqht, ngc li in thng bo khng tm thy. (Yu cu : Tun th cc yu cu v phong cch lp trnh, thit } k topdown v cc k thut Lt hiu qu) void main(void) { } int a =5; printf("F(a) +F(a) = %d\n",F(&a)+F(&a)); a=5; printf("2*F(a) = %d\n",2*F(&a));
}

b-

Cu 3:(0.75) Tinh chnh ti u on code sau: float tong (float *m1, float *m2, int n) { float ta, tb , sum = 0.0; int i = n-1; ta = m1[i]; tb = m2[i]; for (i = n-2; i>=0 ; i--) { sum += ta + tb; ta = m1[i]; tb = m2[i]; } sum += ta + tb; return sum; } Cu 4 : (0.75) Cho bit ngha ca hm sau : void dc(int *a, int *b) { *b ^=*a; *a ^=*b; *b ^=*a; } Cu 5: (0.75) Cho bit hm sau lm g : void bitoperation( int &x,int n) { x |= (1 << (n - 1)); }

Cu 8 : (1.5) Mt chng trnh vit trn mt ngn ng m phng nh sau: void Bidon(){ 1- Khi to Stack S vi con tr T Duyt mng V v lu vo Stack S nu V[i] =0 for (i=1;i <=n;i++) if (V[i] ==0) Push(S,T,i); 2- Duyt Stack for (i =1;i <=n; i++) { if Stack is Empty Return MainProgram; D Stack v in ni dung : Pop(S,T,X); Printf( %d,X); Tm con ca X v np vo Stack; } } Vit li on 2 ca chng trnh c kt qu tng ng m khng phi dng lnh Return MainProgram (thc cht l 1 lnh Goto ).

Dap an se duoc xuat ban sau !

c ng bi VuongVd vo lc 03:41 xut url ny trn Google Nhn: KTLT - De thi KTLT K 53 2010

3 of 5

05/09/2012 09:49 AM

Vu Duc Vuong - SOICT-HUT: De Thi KTLT K53 - 2010

http://vuducvuong-soict-hut.blogspot.com/2010/12/de-thi-ktlt-k53-2010...

0 nhn xt: ng mt Nhn xt

Nhp nhn xt ca bn...

Nhn xt vi t cch:

Chn h s...

Xut bn
Bi ng Mi hn

Xem trc
Trang ch

ng k: ng Nhn xt (Atom)

NGI THEO DI Tham gia trang web ny vi Kt ni Bn b ca Google Thnh vin (37)

Bn l thnh vin ri? ng nhp

GII THIU BN THN VuongVd Xem h s hon chnh ca ti

LU TR BLOG 2011 (2) 2010 (6) thng mi hai (6) Bai thi KTLT K53 BKHN de so 2 Ve Ket qua bai thi KTLT K53 2010 - tiep 2 Ve bai thi KTLT k53 BKHN - Tiep Vai nhan xet ve ket qua bai thi KTLT k53 de thi Tin Dai cuong 2010

4 of 5

05/09/2012 09:49 AM

Vu Duc Vuong - SOICT-HUT: De Thi KTLT K53 - 2010

http://vuducvuong-soict-hut.blogspot.com/2010/12/de-thi-ktlt-k53-2010...

De Thi KTLT K53 - 2010

Mu Simple. Cung cp bi Blogger.

5 of 5

05/09/2012 09:49 AM