i hc Quc Gia TP.

H Ch Minh Trng i hc Bch Khoa Khoa: Khoa hc & K thut My tnh B mn: Khoa hc My tnh

THI CUI HC K 1 Nm hc: 2010 2011 Mn: Cu trc d liu & Gii thut MSMH: 503001 Ngy thi: 20/01/2011 - Thi gian: 120 pht (c s dng ti liu)

Lu : thi gm 4 cu vi thang im 11/10. Cu 1: (2.5 im) Cho mt dy gm 11 s nh sau: 10, 26, 9, 3, 21, 17, 30, 28, 91, 29, 72 a. (1.5 im) Cy AVL c xy dng da trn chui s ny, gi s cc s c nhp vo khi xy dng cy ng theo th t trn. V cy AVL trong cc trng hp sau: Sau khi chn (insert) thnh cng phn t 17. Sau khi chn thnh cng phn t 91. Sau khi chn thnh cng phn t 72.

b. (1 im) Gi s cy AVL c xy dng cu a ln lt b xa cc phn t sau: 9, 3, 29, 26. V li cc cy AVL sau khi tng phn t trn b xa khi cy. Cu 2: (3 im) Ta k hiu L(H) l dng trnh by ca max heap H di dng dy. V d: Mt dy s ban u nh sau: (1, 2, 3), sau khi xy dng thnh heap HT, th L(HT) = (3, 1, 2). a. (1 im) Vi dy s ban u gm 10 s nh sau: (17, 26, 10, 9, 3, 21, 30, 28, 91, 72), ta xy dng thnh heap H1. Gi s cc s c a vo H1 theo ng th t trn. Cho bit L(H1). b. (0.5 im) Sau khi loi b 3 phn t khi H1, ta c H2. Cho bit L(H2). c. (1.5 im) Trnh by mt gii thut s dng heap sp xp li mt dy s vi yu cu nh sau: Input: Dy s a c n phn t t a[1] n a[n] Output: Dy s a c sp xp theo th t nh sau: cc s chn sp trc, cc s l sp sau, cc s chn c sp xp t nh n ln, cc s l c sp t ln n nh V d: Nu a l (7, 4, 2, 1, 16, 19, 23, 24), sau khi sp xp s l (2, 4, 16, 24, 23, 19, 7, 1) Do s lng phn t n ca dy a l kh ln, gii thut sp xp ny khng c khai bo thm bin ph c dung lng lu tr tng ng vi n (v d nh khai bo mt dy tm c ln l n/10 v n/10 v n l tng ng). 1

Cc phng thc c bn ca heap c cho nh trong b slide l thuyt ca mn hc. Tuy nhin, khi s dng cc phng thc ny sinh vin phi ghi r l phng thc ca max heap hay min heap. V d khi s dng phng thc ReheapUp ca max heap th tn phng thc s l ReMaxheapUp, cn tn phng thc ny ca min heap s l ReMinheapUp. Cu 3: (3.5 im) C 6 thnh ph c tn A, B, C, D, E, F. Ngi ta d nh xy dng ng giao thng ni gia cc thnh ph sao cho gia 4 thnh ph bt k th lun c t nht mt thnh ph c ng giao thng trc tip n 3 thnh ph cn li. a. (0.5 im) V mt th v hng tha mn yu cu trn vi A, B, C, D, E, F l 6 nh ca th, ng giao thng trc tip gia 2 thnh ph l cnh ni gia 2 nh. b. (0.5 im) Chuyn th trong cu a thnh th c hng theo quy tc sau: cnh ni v hng (x,y) s chuyn thnh cnh ni c hng t x n y nu x ng trc y trong bng ch ci. Trnh by li th ny di dng bng k (adjacency table). c. (0.5 im) Chng minh th trong cu b khng bao gi xut hin chu trnh. d. (1 im) Cho bit cc topological order ca th trong cu b tng ng vi cc phng php depth-first ordering v breadth-first ordering. e. (1 im) (bonus) e1. Dnh cho lp thng: Vi mt th v hng n nh cho trc, xc nh s k ln nht sao cho gia k nh bt k trn th th lun c t nht mt nh c cnh ni n k-1 nh cn li. Vit gii thut tnh s k ny. e2. Dnh cho lp KSTN (khng cn lm cu e1): Bi ton c nu trong cu e1 thuc v lp P hay NP? V sao? Cu 4: (2 im) Cho mt dy gm 11 s nh sau: 10, 26, 9, 3, 21, 17, 30, 28, 91, 29, 72 a. (1 im) Xy dng hai cy B-tree tng ng vi dy s trn, vi s bc ca hai cy ny l 3 v 5. Gi s th t cc phn t c a vo cy tng ng vi th t trn dy. b. (1 im) V li hai cy B-Tree c xy dng cu a sau khi xa phn t 21 ra khi hai cy ny.

-- Ht --