Cpt S 223: Advanced Data Structures
Spring 2013

Times: MWF 12:10pm - 1:00pm
Location: Sloan 175
Instructor: Nirmalya Roy
Instructor's Office Location and Hours: EME 127, W and F 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,  Tuesday 3:00pm - 4:30pm and Friday 1:00pm - 2:30pm
Teaching Assistant1's Email:  shajiami at eecs dot wsu dot edu

Teaching Assistant 2: Syeda (Selina) Akter
Teaching Assistant2's Office Location and Hours: EME 130,  Monday 10:00am - 11:30am and Wednesday 10:00am - 11:30am
Teaching Assistant2's Email: sakter at eecs 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

Required Textbook:

• Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd Edition), Addison-Wesley, 2006. ISBN: 032144146X; ISBN-13: 9780321441461 

• P.J. Deitel & H.M. Deitel, C++: How to Program (8th ed.), Prentice Hall, 2012. ISBN-10: 0132662361; ISBN-13: 9780132662369
• Andrew Koenig and Barbara E. Moo, Accelerated C++: Practical Programming by Example, Addison-Wesley, 2000  

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 due to unforeseen events, instructor travel, evolving student interests, etc)

Final Exam Schedule: May 2nd (Thursday) 1:00 to 3:00 pm in Classroom (Sloan 175)

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