2110327 Design of Algorithm 2004
Prabhas Chongstitvatana
office Eng. Building 4, Floor 18 Room 13,
tel: 02-2186982, email
me
What's new
15 June 2004 Homework1
Correctness of Bubblesort (hand-in 22 June 2004). Late submission
will not be accepted.
22 July 2004 lecture on memoised
function
17 August 2004 Homework3
Memoised function of C(n,k)
...
Announcement
Quiz 1 will be marked and returned to you on Friday 23rd July 2004, on
a desk in front of my office.
Other lecture of this class
Somchai
Prasitjutrakul 2110427 course pages
my
lecture note of year 2002
my
lecture note of year 2001
my
lecture note of year 2000 ( only part 2)\
Lecture by week
Lecture 1 An
overview of algorithmics
Lecture 2
Lecture 3
Lecture 4
Lecture 5-8 Memoised function
Lecture 9-10
Lecture 11
Lecture 12
Lecture 13
Lecture 14
Lecture 15
Homework
1 Correctness of Bubblesort (hand-in
22 June 2004)
2 . . .
3 Memoised function of C(n,k)
(hand-in 19 August 2004)
4 Proof of correctness of BFS
Reference
main text :
T. Cormen, C. Leiserson, R. Rivest, Introduction to algorithms, MIT
press.
(2 edition include C. Stein 2001)
other text:
Somchai Prasitjutrakul, Analysis and design of algorithms, NASTDA,
2544. (in Thai)
G. Brassard and P. Bradley, Fundamentals of algorithms, Prentice hall,
1996.
G. Rawlins, Compared to what? an introduction to the analysis
of algorithms, Computer science press,
1992.