Computer
Sciences and Software Engineering Department
Seattle University, Seattle
Course Goals
This course is an introduction to data structures and algorithms. Topics include:
- ADT design and implementation
- Algorithm efficiency by Big-O notation
- Binary search trees & AVL trees
- Hashing
- Quicksort
- Heap & Heapsort
- Priority queues
- Mergesort
- Introduction of STL
Textbook
The main textbook is: ADTs, Data Structures, and Problem Solving with C++ (second edition) by Larry Nyhoff.
You are also encouraged to read other relevant materials you can find and the instructor provides.
Course Work and Grading
There will be a series of homework and lab assignments (including quizzes) that
will constitute 30% of your grade. Two mid exams will make up 15% each,
and the final exam will be worth 40%.
Late policy: Late homeworks & lab assignments will not be accepted unless you have a good
excuse AND you have made arrangements with me in advance.
Attendence Policy
Class attendance is strongly encouraged. Any student missing a class is responsible for any
material assigned or covered in class during his/her absence. Students are encouraged to
actively participate in discussions in class.
Instructor
Professor Yingwu Zhu
Office hours: Mondays & Fridays 10:50-11:50am in EGRN 530 or by appointment
Email: zhuy AT seattleu DOT edu