Instructor
Asst. Prof. Dr. Bundit Manaskasemsak
Time and Place
Tuesday 9:00-12:00 @Room E11-S604, Building 11, Eng. KU.
Course Description
The course studies about abstract data types: stack, queues, lists, trees, and graphs; data abstraction;
basic algorithms for problem solving: divide-and-conquer, heuristic methods; analysis of algorithm
complexity.
Students are expected to perform individual studies of literature on relevant topics. You will also
be working on some individual assignments and/or implementation. Each assignment/project must be
submit within the deadline.
References / Text Books
The course presents selected topics from the books:
- "Data Structures and Algorithm Analysis in C", M. A. Weiss, Pearson, 2nd edition, 1996.
- "Introduction to Algorithms", T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, PHI Learning, 3rd edition, 2010.
Course Syllabus
