2110427 Design and Analysis of Algorithm 2001
Prabhas Chongstitvatana
my lecture note of year 2000 ( only part
2)
What's new
29 August 2001 Edit distance,
Probabilistic algorithm
5 September 2001 Local
search 8-queen program
Announcement
Quiz 3 for the students of my section is on Thursday 6 September
Lecture 2 Analysis of algorithm
growth of functions, asymptotic notation (from
Somchai's lecture note 1999, page 10-28) (It is a big pdf file
5.8 MB) also
(from Somchai's lecture note 2000: growth
of function, control
structures ) (they are ppt in pdf 4-up files)
Lecture 4 Dynamic programming
Tutorial 4 Edit distance
Lecture 6 Greedy algorithm
Lecture 8 Exhausive search
Lecture 10 Local search
Lecture 11 Probabilistic algorithms (old
lecture note from year 2000)
Probabilistic algorithms 1, 2
-
introduction ppt
-
numerical : Buffon's needle ppt
-
numerical : Monte Carlo integration
ppt
-
probabilistic counting
-
Monte Carlo : Primality test ppt
-
amplification of stochastic advantage ppt
-
Las Vegas algorithm ppt
-
factorising large integers ppt
-
Basic statistics
-
You can read more about statistics from this site including simulation
applet http://www.math.uah.edu/stat/
Tutorial 11 Probabilistic algorithms
-
amplification of stochastic advantage
-
example of probabilistic algorithms
-
8-queen program
Lecture 12 String matching
Lecture 13 Geometrical algorithms
Final lecture summary and topics you
must know to pass this course