Cu trc d liu v gii thut Thy Nguyn c Ngha. I.Ti liu hc tp trn lp.

. Bi ging mn Cu trc d liu v gii thut. (ging hon ton vi slide ca thy). II.Danh sch cc ti liu tham kho. Tham kho thm cun :Cu trc d liu v gii thut Xun Li.Cn mnh ngh cun bi ging ca thy cng kh c bn,y v chi tit ri. III.Ni dung n tp. 0. Tng quan v mn hc. Mc ch mn hc nhm gip sinh vin nm bt c phng php t chc lu tr thng tin my tnh. T bit la chn cu trc d liu gii quyt cc bi ton. Ni dung mn hc bao gm hai phn: Nhng vn c bn v mi quan h gia cu trc d liu v gii thut, phn tch thit k thut ton, gii thut qui; Gii thiu mt s cu trc d liu (mng, danh sch, cy, th...), thut ton sp xp, tm kim. 1.Chng 1. Cc khi nim c bn. 1.1. Thut ton v phc tp. 1.2. Phn bin cc k hiu tim cn: (tim cn ng),O (tim cn trn), (tim cn di). Cch ni v thi gian tnh: - O(f(n)) : c hiu l nh gi thi gian tnh trong tnh hung ti nht. - (f(n)): c hiu l nh gi thi gian tnh trong tnh hung tt nht. - (f(n)): c hiu l thi gian tnh trong mt tnh hung c th no . 1.3. Gi ngn ng. 1.4. Mt s k thut phn tch thut ton. 1.4.1.Phn tch vng lp for, while, repeat. for i = 1 to m do P(i); Gi s thi gian thc hin P(i) l t(i).Khi thi gian thc hin vng lp for s l

t (i) .
i= 1

Phn tch vng lp while,for xem trong gio trnh nh.C c v d minh ha. 1.4.2.Cu lnh c trng. 2.Chng 2 : Thut ton quy. 2.1. Khi nim quy. 2.2. Thut ton quy. - Cu trc ca thut ton quy. - Thut ton chia tr. - Mt s v d. 2.3. Phn tch thut ton quy. - Phn tch thi gian ca thut ton chia tr.(Quan trng). - nh l th rt gn. (S dng m khng cn phi chng minh). 2.4. quy c nh.

- Dng tng hiu qu ca thut ton quy i vi nhng bi ton c s lng bi ton con trng lp l ln. 2.5.Chng minh tnh ng n ca thut ton quy.(S dng quy np ton hc). 2.6.Thut ton quay lui. 3.Chng 3. Cc cu trc d liu c bn. 3.1.Cc khi nim. - Kiu d liu, kiu d liu tru tng,cu trc d liu. 3.2.Mng. - Phn b b nh cho mng. - Cc thao tc vi mng : chn , xa. 3.3.Danh sch. - nh ngha. - Cc php ton c bn : Creat, Insert, Locate, Retrieve, Delete, Next, Prev - Cc cch ci t danh sch tuyn tnh. + Biu din di dng mng. + Danh sch mc ni : ni n, ni i. - Cc v d ng dng: bi ton Josephus, biu din a thc 3.4.Ngn xp. - nh ngha. - Ci t: dng mng (khi bit trc c s phn t ca ngn xp), dng danh sch mc ni khi khng bit trc s phn t.C 2 thao tc chnh l: Push (y 1 phn t vo ngn xp), Pop (ly 1 phn t ra ngn xp). - Cc ng dng. + Ngoc hp cch. + Snh i th trong HTML. + Bi ton i c s. + Tnh gi tr biu thc (Quan trng). o Cn nm r cc cch chuyn t trung t v hu t. o Nm r cc ngn xp gi php ton. o Nm r thut ton tnh gi tr biu thc hu t s dng ngn xp, trnh by tng bc c th, v ngn xp ti tng bc + Kh quy. 3.5.Hng i. - nh ngha. - Ci t: dng mng, danh sch mc ni. - Cc ng dng. Ch : vi mi cu trc d liu cn hiu r cc thao tc vi chng v c th ta s phi trnh by c th cc thao tc . 4.Chng 4. Cy. 4.1. nh ngha v cc khi nim. - Cc thut ng chnh: nt, gc, l, con, cha, t tin, hu du, anh em, chiu cao, chiu su. - Cy c th t: Th t trc, sau, gia.(Quan trng): cm nm r cch duyt theo cc th t ny.

- Cy c nhn. - ADT Cy: Biu din cy dng danh sch cc con, dng mng con tr cha. 4.2.Cy nh phn. - nh ngha v tnh cht: Cy hon chnh, cy y , cu cn i. - Biu din cy nh phn, cc thao tc tng ng: - Duyt cy nh phn: th t trc, gia, sau. (Quan trng). - Cc v d ng dng: cy biu thc, cy quyt nh, m Huffman. 5.Chng 5. Cc thut ton sp xp. 5.1. Bi ton sp xp. - Yu cu nm c khi nim: tnh n nh, ti ch 5.2.Ba thut ton sp xp c bn: ni bt, chn, chn. 5.3.Sp xp trn. 5.4.Sp xp nhanh. 5.5.Sp xp vun ng. - Nm c khi nim ng, hng i c u tin. - Nm c cc hot ng ca ng Max-heap, Min-heap. 5.6. phc tp tnh ton ca bi ton sp xp. 5.7.Cc phng php sp xp c bit: m, sp xp theo c s, ng gi. 6.Chng 6. Tm kim. 6.1.Tm kim tun t v tm kim nh phn. 6.2.Cy nh phn tm kim. - nh ngha. - Biu din. - Ci t cc php ton: makeTreeNode, insert, search, delete. 6.3.Cy nh phn tm kim cn bng. - Ch cn nm c nh ngha v nhn bit c th no l cy nh phn tm kim cn bng. 6.4.Tm kim xu mu. - Thut ton trc tip. - Thut ton Boyer Moore. - Thut ton Rabin Karp. - Thut ton Knuth Morris Partt. Vi cc thut ton trn: cn nm c cch pht biu thut ton v cc lm vic ca tng thut ton. 6.5.Bng bm. - Cn nm c: a ch trc tip, hm bm, cch gii quyt xung t, a ch m, to chui. 7.Chng 7. th v cc thut ton th. 7.1. th. - Cc khi nim: tp nh, tp cnh, th v hng, th c hng, ng i, chu trnh, tnh lin thng 7.2.Biu din th. - Biu din bng ma trn k, danh sch k, danh sch cnh.

7.3.Cc thut ton duyt th. - Thut ton tm kim theo chiu rng.(BFS) - Thut ton tm kim theo chiu su.(DFS) 7.4.Mt s ng dng ca tm kim trn th. - Bi ton ng i. - Bi ton lin thng. - Bi ton sp xp Topo. - Bi ton tm bao ng truyn ng. 7.5.Bi ton cy khung nh nht. - Thut ton Kruskal. - Ci tin Kruskal vi cu trc d liu Disjoint Sets. 7.6.Bi ton tm ng i ngn nht. - Thut ton Dijkstra vi cu trc d liu hng i c u tin. IV. thi. - C th mua cc t thi cc qun photo trong trng lm th. - Mt thi tham kho. Bi 1.Xt thut ton tnh gi tr ca f(x,n)= x n th hin trong hm F(x,n) sau y: int F(int x, int n) { if (n= =0) return 1; else if (n % 2 = = 0) return F(x,n/2)*F(x,n/2); else return F(x,n/2)*F(x,n/2)*x; } Gi T(n) l thi gian tnh ca thut ton ni trn.Gi thuyt l cc php ton s hc c thc hin vi thi gian b chn l hng s. a) Xc nh cng thc quy cho T(n). b) Gii cng thc quy a ra nh gi ca T(n) trong tnh hung ti nht. Bi 2. i vi mi mt trong cc kiu cu trc d liu sau y: Danh sch ni n, dnh sch ni kp, hng i dng mng.Hy v cu trc d liu c c sau khi ln lt b sung cc phn t ca dy cc kha: 4,2,6,7,6,5 Bi 3. a) Biu din cch s dng ngn xp chuyn biu thc dng trung t v dng hu t: a b * c ^ d f b) Hy trnh din cch tnh gi tr ca biu thc hu t sau s dng ngn xp: 12+31+*11+1-/ Bi 4. Cho cy nh phn hnh bn.Hy a ra th t cc nh xc nh bi duyt cy theo th t trc, gia, sau. Bi 5. Cho mng A=(0,2,4,3,8,9,6,5,7) biu din 1 Min-heap. a) V cy nh phn tng ng vi Min-heap cho. b) Trnh by cc thao tc cn thc hin trn cy b sung

thm key=1 vo min-heap ni trn thu c 1 min-heap mi. Bi 6. Struct TreeNode { float key; struct TreeNode * LeftPtr; struct TreeNode * RightPtr; }; Typedef struct TreeNode BSTree; a) Hy vit hm C s dng cu trc d liu trn thc hin cc thao tc sau y vi cy nh phn. - To mt nt mi. BSTree *makeTreeNode(float value); - B sung mt nt mi vo cy nh phn tm kim. BSTree *insert(BSTree * nodePtr, float item); b) V cy nh phn tm kim i vi tp cc kha S =(3,2,5,4,7,6,1) thu c nh thc hin b sung ln lt cc kha theo th t cho vo cy nh phn.Khi to ban u l rng