Phn tch v thit k thut

ton


Nguyn Thanh Bnh
ng Thin Bnh
Khoa Cng ngh Thng tin
Trng i hc Bch khoa
i hc Nng
2
Mc ch
Cc khi nim lin quan n bi ton v
gii quyt bi ton
Phn tch v nh gi thut ton
Cc k thut thit k thut ton
Vn dng gii quyt cc bi ton c th
3
Ni dung
Gii thiu
Chng minh s ng n
phc tp (complexity)
quy (recursion)
Chia tr (divide and conquer)
Quy hoch ng (dynamic programming)
Thut ton tham lam (greedy algorithms)
Quay lui (backtracking)
4
nh gi
Thi gia k
Thi kt thc mn hc
im bi tp
5
Ti liu tham kho
1. Introduction to algorithms, T.H. Cormen, C.E.
Leiserson, R.R. Rivest, Mit Press 1990.
2. Type de Donnes et Algorithmes, M-C Gaudel, M. Soria, C.
Froidevaux, Ediscienne international, 1993.
3. Cours Complexit, M. Daniel, ESIL, 2006.
4. Data structures and algorithms, Alfred V. Aho, John E.
Hopcroft, Addison-Wesley, 1983.
5. Algorithm Analysis and Computational Comlexity, Ian
Parberry, Lecture Notes, University of North Texas, 2001.
6. The Art of Computer Programming, Volume 2, D. Knuth,
Addison-Wesley, 1981.
7. Cc ti liu khc trn Internet.
6
Bi tp
Mi nhm hc vin(<= 2 em) chn trnh by mt trong
cc ch sau:
K thut nhnh v cn (branch and bound)
K thut bin i Fourier (Fourier transform)
Thut ton di truyn (genetic algorithm)

Yu cu
Tm hiu v trnh by v ch
Minh ho v gii thch phng php bi t nht 2 v d c th
nh gi v phn tch gii php cc v d
Hc vin t tm kim cc ti liu lin quan n ch
Kt qu
Bo co t 10 n 20 trang
Bo co phi trch dn r rng cc ti liu tham kho