B GIO DC V O TO TRNG I HC CN TH

CNG CHI TIT HC PHN

Hc phn: Cu trc d liu Data structures - M s: CT103 - S Tn ch: 4 + Gi l thuyt: 45 + Gi thc hnh: 30 1. Thng tin ging vin Tn ging vin:TS. Trn Cao Tn ngi cng tham gia ging dy: Phan Huy Cng, Lm Hoi Bo, Nguyn Cng Danh, Trng Th Thanh Tuyn. n v: B mn CNPM in thoi: 071.831.301 E-mail: tcde@cit.ctu.edu.vn 2. Hc phn tin quyt: TH101 Lp trnh cn bn A 3. Ni dung 3.1. Mc tiu: Mc tiu mn hc nhm trang b cho sinh vin kin thc v cc kiu d liu tru tng t chc d liu v thao thc trn d liu. Sau khi hc xong mn ny, sinh vin s: Nm c khi nim kiu d liu, kiu d liu tru tng. Nm vng cc cu trc d liu v dng cc cu trc d liu ci t cc kiu d liu tru tng c bn nh danh sch, ngn xp, hng i, cy, tp hp, bng bm, th bng trong mt ngn ng lp trnh cn bn. Vn dng c cc kiu d liu tru tng gii quyt cc bi ton n gin trong thc t.

3.2. Phng php ging dy: Ging vin ging dy l thuyt trn lp vi s h tr ca my chiu (projector), n chiu (overhead) v bng, phn. Phng php ch yu l thuyt trnh, nu vn , truyn t phng php lp trnh sinh vin rn luyn t duy gii thut v k nng lp trnh. 3.3. anh gia mn hoc: - Thc hnh - Thi kt thc 50% 50%

4. cng chi tit: (nu nhng vn chnh hc vin s c hc tp v trao i) Ni dung

CHNG I: M U I. T BI TON N CHNG TRNH 1. M hnh ha bi ton thc t 2. Gii thut (algorithms) 3. Ngn ng gi v tinh ch tng bc (Pseudol d t i fi t)

Tit bui 5 tit

language and stepwise refinement) 4. Tm tt II. KIU D LIU TRU TNG (ABSTRACT DATA TYPE) 1. Khi nim tru tng ha 2. Tru tng ha chng trnh 3. Tru tng ha d liu III. KIU D LIU - CU TRC D LIU V KIU D LIU TRU TNG (DATA TYPES, DATA STRUCTURES, ABSTRACT DATA TYPES) CHNG II: CC KIU D LIU TRU TNG C BN (BASIC ABSTRACT DATA TYPES) I. KIU D LIU TRU TNG DANH SCH (LIST) 1. Khi nim danh sch 2. Cc php ton trn danh sch 3. Ci t danh sch II. NGN XP (STACK)

15

1. 2. 3. 4.

nh ngha ngn xp Cc php ton trn ngn xp Ci t ngn xp ng dng ngn xp loi b qui ca chng trnh

III. HNG I (QUEUE) 1. nh Ngha 2. Cc php ton c bn trn hng 3. Ci t hng 4. Mt s ng dng ca cu trc hng IV. DANH SCH LIN KT KP (double - lists) BI TP CHNG III: CU TRC CY (TREES) I. CC THUT NG C BN TRN CY 1. nh ngha 2. Th t cc nt trong cy 3. Cc th t duyt cy quan trng 4. Cy c nhn v cy biu thc II. KIU D LIU TRU TNG CY III. CI T CY 1. Ci t cy bng mng 2. Biu din cy bng danh sch cc con 3. Biu din theo con tri nht v anh em rut phi: 4. Ci t cy bng con tr IV. CY NH PHN (BINARY TREES) 1. nh ngha 2. Duyt cy nh phn 3. Ci t cy nh phn V. CY TM KIM NH PHN (BINARY SEARCH TREES) 1. nh ngha 2. Ci t cy tm kim nh phn BI TP

10

CHNG IV: TP HP I. KHI NIM TP HP II. KIU D LIU TRU TNG TP HP III. CI T TP HP 1. Ci t tp hp bng vector Bit 2. Ci t bng danh sch lin kt IV. T IN (dictionary) 1. Ci t t in bng mng 2. Ci t t in bng bng bm 3. Cc phng php xc nh hm bm V. HNG U TIN (priority queue) 1. Khi nim hng u tin 2. Ci t hng u tin BI TP CHNG V TH (GRAPH) I. CC NH NGHA II. KIU D LIU TRU TNG TH III. BIU DIN TH 1. Biu din th bng ma trn k 2. Biu din th bng danh sch cc nh k IV. CC PHP DUYT TH (traversals of graph) 1. Duyt theo chiu su (depth-first search) 2. Duyt theo chiu rng (breadth-first search) V. MT S BI TON TRN TH 1. Bi ton tm ung i ngn nht t mt nh ca th (the single source shorted path problem) 2. Tm ng i ngn nht gia tt c cc cp nh 3. Bi ton tm bao ng chuyn tip (transitive closure) 4. Bi ton tm cy bao trm ti thiu (minimum-cost spanning tree)

10

5. Ti liu ca hc phn: [1] Aho, A. V. , J. E. Hopcroft, J. D. Ullman, "Data Structure and Algorihtms", AddisonWesley; 1983. [2] Michel T. Goodrich, Roberto Tamassia, David Mount, Data Structures and Algorithms in C++, Weley International Edition; 2004. [3] Xun Li, "Cu trc d liu v gii thut", Nh xut bn khoa hc v k thut, H ni, 1995. [4] N. Wirth " Cu trc d liu + gii thut= Chng trnh", 1983. [5] Nguyn Trung Trc, "Cu trc d liu", HBK TP.HCM, 1990. [6] L Minh Trung, Lp trnh nng cao bng Pascal vi cc cu trc d liu, 1997. [7] Ng Trung Vit, Ngn ng lp trnh C v C++ Bi ging- Bi tp Li gii mu, NXB Giao thng vn ti, 2000. [8] Nguyn nh T, Hong c Hi, Gio trnh l thuyt v bi tp ngn ng C, NXB Gio dc, 1998. [9] L Xun Trng, Gio trnh cu trc d liu bng ngn ng C++, NXB thng k, 1999.

[10] Nguyn Thanh Thy, Nguyn Quang Huy, Bi tp lp trnh ngn ng C, NXB Khoa hc k thut, 1999. [11] http://courses.cs.hcmuns.edu.vn/ctdl1/Ctdl1/index.html [12] http://www.cs.ualberta.ca/~holte/T26/top.realTop.html [13] http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/ds_ToC.html [14] http://pauillac.inria.fr/algo/AofA/ [15] http://www.cs.pitt.edu/~kirk/algorithmcourses/ Ngy 8 thng 10 nm 2007 Ngi bin son

Duyt ca n v

TS. Trn Cao