1st
semester 2009
Section 1 Wed 13-14:30, Fri
13-14:30 room 2304/2
Prabhas Chongstitvatana
contact me at: prabhas at chula dot ac dot th
office: Engineering Building 4, floor 18, room 13
phone: 02-218-6982
syllabus
lecture year 2008
Score mid term part 2 (all students) Score
part
1 (all students)
Analysis of
performance of
students' midterm (ppt)
Old exam questions
from Aj. Vishnu
Old exam questions
from Aj. Prabhas
Final Raw and Net score
Week
1 Analysis
of
algorithms Java refresh
2 Intro to algorithms
Asymptotic notation Recurrence Analysis
of algorithm: how to
2.1 Intro to
datastructure & Algo (ppt
modified-Vishnu)
3 List ( ListStackQueue
ppt
Vishnu)
4 Stack
5 Queue (queue
Somchaip ppt) NEW
6 Trees and Binary Search Trees ( Tree ppt Vishnu )
7 AVL trees (
ppt Vishnu )
8 midterm
9 Hash (
ppt
Vishnu ) my hash code
10 Heap (1) ( ppt
Jaruloj) code of priority
queue
11 Heap (2)
12 Sorting (1) sorting
Weiss code
13 Sorting (2) Java code of all sorts
14 Spare Application
of
Data Structure (ppt Somchaip) NEW
15 Summary and Revision
Midterm Exam 40%
Final Exam 40%
Homework 20%
Mark Allen Weiss, Data Structures and Algorithm
Analysis in
Java (Second Edition), Addison-Wesley, 2007, ISBN: 0-321-37013-9.
see author's home page: http://www.cs.fiu.edu/~weiss/
for
errata
and source code.
Java code from the textbook version Summer
2008 (zip file )
My hash code (hash.zip)
14 Aug
2009 Write two Java programs to sort 1 million
numbers: 1) use Bubble sort 2) use Quick sort. Compare the running
time.
19 Aug 2009 In class work: write Binary
Search
using recursion.
... (will fill in soon)
9 Oct 2009 Write findMax of a heap
data
structure
14 Oct 2009 Invent a hash function, try it on
five to
ten strings of your friends phone numbers or student id.
28 Oct 2009 Explain how insertion sort (see
lecture intro to algo above) work.
Informal proof why
it works correctly. What is its running time complexity?
18 Nov 2009 Write mergeSort and quickSort
20 Nov 2009 Write percolate Down
last update 14
Jan 2010