TRNG I HC BCH KHOA PHNG O TO SH

CNG HA X HI CH NGHA VIT NAM c lp - T do - Hnh phc

CNG MN HC LP B TC KIN THC, CHUYN I NGNH PHC V K THI TUYN SINH SH NM 2005
(Chuyn ngnh Khoa hc my tnh) 1. Tn mn hc: Cu trc d liu v gii thut 2. Ging vin mn hc: Bi Hoi Thng 3. n v ph trch ging dy: B mn C s d liu, Khoa Cng ngh Thng tin 4. M t mn hc: Cc cu trc d liu chui, danh sch tuyn tnh v danh sch lin kt, stack v queue, cy, bng bm v cc gii thut c dng cho cc cu trc ny. Cc gii thut sp th t, tm kim v mt s ng dng cc cu trc d liu gii cc bi ton v th. 5. Mc tiu mn hc: Gip ngi hc nm vng cc kin thc cn thit trn cc cu trc d liu nu cng nh c cc kh nng cn thit v lp trnh p dng cc kin thc ny. 6. Ni dung mn hc: Chng 1 2 Ni dung Chui - Chui v cch phn chia chui - Cc php ton: Brute-Force, Knuth-Morris-Pratt Danh sch - Danh sch v cc php ton trn danh sch - Danh sch c - Danh sch lin kt - Cc danh sch hn ch (stack, queue) Cy - Cc khi nim v nh ngha - Cc cch biu din cy v cch lu tr trong b nh - Cc php duyt cy Sp th t - Sp th t dy: insertion sort, selection sort, shell sort, heap sort, quick sort, merge sort, bubble sort - Sp th t tp tin: trn trc tip, trn t nhin Tm kim - Tm kim tun t - Tm kim nh phn - Cy BST - Cy AVL - Cy B Bm - nh ngha bm v hm bm - Gii quyt ng : ni kt, a ch m S tit 3 6 Ti liu tham kho [1] [1]

[1], [2]

[1], [2]

[1], [2]

[1]

th -

3 th v hng v c hng Lu tr th trong b nh Cc bi ton tm kim chiu su, chiu rng Bi ton tm ng i ngn nht

[1], [2]

7. Ti liu tham kho: [1] Nguyn Trung Trc, 2002. Cu trc d liu v gii thut. H Quc Gia Tp.HCM [2] R.Sedgewick, 1988. Algorithms. 8. Phng php nh gi mn hc: thi Trng b mn Ngy 30 thng 09 nm 2004 Cn b ph trch ging dy

Bi Hoi Thng