Cpt S 223: Advanced Data Structures
Spring 2012

Times: MWF 12:10pm - 1:00pm
Location: Sloan 169
Instructor: Nirmalya Roy
Instructor's Office Location and Hours: EME 127, M 1:00pm - 2:00pm, WF 2:00pm - 3:00pm, or by appointment
Instructor's Email: nroy at eecs dot wsu dot edu

Teaching Assistant 1: Shervin Hajiamini
Teaching Assistant1's Office Location and Hours: Sloan 343,  Wednesday and Friday 1:00pm - 2:30pm
Teaching Assistant1's Email: shervin.hajiamini at email dot wsu dot edu

Teaching Assistant 2: Chenhui Yin
Teaching Assistant2's Email: chenhui.yin at email dot wsu dot edu

Course Descriptions: This course is about data structures, methods of organizing large amounts of data so they can be used efficiently, and algorithm analysis, the estimation of the running time of algorithms. Different kinds of data structures to be discussed include abstract data types (lists, stacks, queues), trees (e.g. binary search trees, splay trees, B-trees), hash tables, heaps or priority queues, disjoint sets, and graphs. Algorithms for sorting and searching, trees, and graphs will also be discussed together with their analysis. The various data structures and algorithms are to be implemented in C++ using the object-oriented programming paradigm.

Course Objectives: At the end of this course, you should be able to:

• Assess how the choice of data structures and algorithms impacts the performance of programs;
• Choose the appropriate data structures and algorithms to use for a specified problem or application;
• Implement the data structures and algorithms in C++ using the object-oriented programming paradigm; and
• Solve problems using the various data structures and algorithms and write programs for their solutions.

Course Prerequisites: Cpt S 122 (Data Structures), Math 216 (Discrete Structures) or equivalent

Texts:

• Data Structures and Algorithm Analysis in C++, Third Edition by Mark Allen Weiss
• Accelerated C++: Practical Programming by Example, 2000 by Andrew Koenig and Barbara E. Moo

Textbook Source Code:

• Source Code for Data Structures and Algorithm Analysis in C++, Third Edition by Mark Allen Weiss

Course Requirements and Grading:

Tentative Course Schedule:
(Subject to change as the semester progresses)

Final Exam Schedule: May 1st (Tuesday) 1:00 to 3:00 pm in Classroom (Sloan 169)

Student Course Evaluations Link:   https://skylight.wsu.edu/student

Acknowledgement: Prof. Larry Holder, Dr. Teddy Yap