Project I.

Gii thut v lp trnh C 2011

Project I. CH : GII THUT V LP TRNH C

Lp: KTMT&TT1-K54 Thi gian: 15 tun (Tun 2-16) Bi 1. Gii thut Sp xp (Sorting Algorithms) 1. Tm hiu cc gii thut sp xp dy (8 gii thut): - Sp xp kiu chn (Selection Sort) - Sp xp ni bt (Bubble Sort) - Sp xp kiu chn (Insertion Sort) - Sp xp kiu phn on (Quick sort) - Sp xp kiu vun ng (Heap Sort) - Sp xp trn (Merge Sort) - Sp xp bng php m phn ph i (Distribution Counting) - Sp xp bng c s (Radix Sort): Theo kiu hon v cc kha (Radix Exchange Sort) v sp xp c s trc tip (Straight Radix Sort) 2. Ci t cc gii thut sp xp trn (Vit chng trnh C) - D liu vo trong file vn bn SORT.INP cha khng nhiu hn 106 kho v gi tr m i kho l s t nhin khng qu 106. Kt qu c ghi ra file vn bn SORT.OUT cha dy kho c sp, mi kho trn mt dng.

- Chng trnh c giao din di dng menu, m i chc nng tng ng vi mt thut ton sp xp. (Gi cc chng trnh con). - nh gi, nhn xt v phc tp ca cc gii thut sp xp trn. Bi 2. Cu trc d liu danh sch 1. Tm hiu v cu trc d liu danh sch (ni n, ni kp, n i vng). Cc k thut x l (duyt, thm/bt phn t, tm kim) 2. Thc hnh vit chng trnh C gii bi ton sau: Lp chng trnh qun l danh sch sinh vin, tu chn loi danh sch cho ph hp, chng trnh c nhng chc nng sau: (H s mt sinh vin gi s c: Tn, lp, s in thoi, im TB ) - Cho php nhp danh sch sinh vin t bn phm hay t file. - Cho php in ra danh sch sinh vin g m c tn v xp loi - Cho php in ra danh sch sinh vin gm cc thng tin y 1 B mn K thut My tnh Vin CNTT&TT

Project I. Gii thut v lp trnh C 2011 Cho php nhp vo t bn phm mt tn sinh vin v mt tn lp, tm xem c sinh vin c tn nhp vo trong lp khng ?. Nu c th in ra s in thoi ca sinh vin . Cho php vo mt h s sinh vin mi t bn phm, b sung sinh vin vo danh sch sinh vin, in ra danh sch mi. Cho php nhp vo t bn phm tn mt lp, loi b tt c cc sinh vin ca lp khi danh sch, in ra danh sch mi. C chc nng sp xp danh sch sinh vin theo th t gim dn ca im trung bnh. Cho php nhp vo h s mt sinh vin mi t bn phm, chn sinh vin vo danh sch m khng lm thay i th t sp xp, in ra danh sch mi. Cho php lu tr li trn a danh sch sinh vin khi thay i.

Bi 3. Cu trc d liu ngn xp (stack) hng i (queue): 1. Tm hiu cu trc d liu ngn xp, hng i. Cc k thut x l trn ngn xp, hng i. 2. Vn dng vit chng trnh C gii bi ton sau: - Hnh v m t di chuyn cc toa tu ti mt ga xe la:

- Ban u ng ray A cha cc toa tu nh s t 1 ti n theo th t t tri qua phi, ngi ta mun chuyn cc toa sang ng ray C c mt th t mi l mt hon v ca (1, 2, , n) theo quy t c: ch c a cc toa tu chy theo ng ray theo hng mi tn, c th dng on ng ray B cha tm cc toa tu trong qu trnh di chuyn. a) Hy nhp vo hon v cn c, cho bit c phng n chuyn hay khng, v nu c hy a ra cch chuyn: V d: n = 4; Th t cn c (1, 4, 3, 2) 1)A C; 2)A B; 3)A B; 4)A C; 5)B C; 6)B C b) Nhng hon v no ca th t cc toa l c th to thnh trn on ng ray C vi lut di chuyn nh trn. Bi 4. Cu trc d liu cy (Tree). Biu th tin t, hu t. - Tm hiu v cu trc d liu cy (Tree) v cc k thut x l. - Tm hiu k php tin t, trung t, hu t. - Vit chng trnh C tnh gi tr ca mt biu thc: Input: File vn bn CAL.INP ch g m 1 dng c khng qu 255 k t , l mt biu thc s hc dng trung t cha cc s thc v cc ton t {(, ), +, -, *, /}. Output: File vn bn CAL.OUT cha: - Dng hu t ca biu thc - Dng tin t ca biu thc - Kt qu biu thc . 2 B mn K thut My tnh Vin CNTT&TT

Project I. Gii thut v lp trnh C 2011

Bi 5. K thut nhnh cn, bi ton ngi du lch Cho n thnh ph nh s t 1 n n v m tuyn ng giao thng hai chiu gia chng, mng li giao thng ny c cho bi bng C cp nxn, y C[i, j] = C[j, i] = Chi ph i on ng trc tip t thnh ph i n thnh ph j. Gi thit rng C[i, i] = 0 vi i, C[i, j] = + nu khng c ng trc tip t thnh ph i n thnh ph j. Mt ngi du lch xut pht t thnh ph 1, mun i thm tt c cc thnh ph cn li m i thnh ph ng 1 ln v cu i cng quay li thnh ph 1. Hy ch ra cho ngi hnh trnh vi chi ph t nht. Bi ton gi l bi ton ngi du lch hay bi ton hnh trnh ca mt thng gia (Traveling Salesman). Vit chng trnh C gii bi ton ny vi yu cu: Input: file vn bn TOURISM.INP Dng 1: Cha s thnh ph n (1 n 100) v s tuyn ng m trong mng li giao thng m dng tip theo, m i dng ghi s hiu hai thnh ph c ng i trc tip v chi ph i trn qung ng (chi ph ny l s nguyn dng 10000) Output: file vn bn TOURISM.OUT, ghi hnh trnh tm c. Minh ha:

Bi 6. Bi ton qui hoch ng, bi ton ci ti. Trong siu th c n gi hng (n 100), gi hng th i c trng lng l W[i] 100 v tr gi V[i] 100. Mt tn trm t nhp vo siu th, tn trm mang theo mt ci ti c th mang c ti a trng lng M ( M 100). Hi tn trm s ly i nhng gi hng no c tng gi tr ln nht. Vit chng trnh gii bi ton trn vi yu cu: Input: file vn bn BAG.INP Dng 1: Cha hai s n, M cch nhau t nht mt du cch n dng tip theo, dng th i cha hai s nguyn dng W[i], V[i] cch nhau t nht mt du cch Output: file vn bn BAG.OUT Dng 1: Ghi gi tr ln nht tn trm c th ly Dng 2: Ghi ch s nhng gi b ly

3 B mn K thut My tnh Vin CNTT&TT

Project I. Gii thut v lp trnh C 2011

Bi 7. Thut ton Dijkstra tm ng i ngn nht C n thnh ph (nh s 1,2,n). S mng li giao thng ca n thnh ph cho bi ma trn A[i,j] trong : - A[i,j] l di ng i t thnh ph i n thnh ph j. - A[i,j] = nu khng c ng i t thnh ph i n thnh ph j. - A[i,j] nguyn, khng m. - C th tn ti ng mt chiu hoc 2 chiu gia 2 thnh ph i, j. (Nu khng c chiu t i n j th A[i,j]= , nhng c chiu t j n i th A[j,i] = c). Hy xc nh ng i ngn nht t thnh ph s n thnh ph f. Input: File vn bn MINPATH.INP vi n i dung: - Dng u ghi s n l thnh ph (0<n<100), s cung ng m, nh s, nh f. M i gi tr cch nhau t nht mt du cch. - m dng tip theo m i dng cha 3 gi tr i, j, A[i,j] (Cch nhau t nht mt du cch). Cho bit khong cch A[i,j] ca ng i t thnh ph i n thnh ph j. Output: File vn bn MINPATH.OUT cha ng i ngn nht t nh s n f v gi tr ng i ngn nht tm c. Minh ha:

Cch nh gi: - Mi sinh vin vit bo co thu hoch cc bi tp trn (trnh by tm tt vn l thuyt, gii thut ci t, kt qu th nghim chng trnh) - Lp trnh C cho cc bi tp trn. - Kim tra vn p bi cc thy, c hng dn.

4 B mn K thut My tnh Vin CNTT&TT