Syllabus

CS 302: Advanced Data Structures

Summer 2009

Grading Note: The programming projects are an important part of the course. Students MUST PASS the project portion of the class to PASS the class.

Learning Outcomes and Course Objectives: This course continues the exploration of data structures, algorithms for manipulating them, and the practical problems of implementing those structures in real programming languages and environments. Attention is paid to the analysis of algorithms to characterize their worst and average case requirements for running time and memory.

Perhaps more than any other courses, CS 301 and 302 should expand the students tool box of basic techniques for manipulating data at both the conceptual and the concrete level. At the conceptual level, the student will see a broad selection of standard practices and approaches used in program design. At the concrete level, the student will begin what should be a career-long practice of accumulating useful, reusable code units.

The basic organization of this course will proceed through the classic data structures and Java-based containers, exploring the use and implementation of each in turn. Motivating problems will be drawn from a variety of application areas.  Specifically:

• The student will be able to demonstrate the use of basic complexity measures.  The student will be able to apply these measures to basic algorithms.  The student will be able to give a general description of how these complexity measures are obtained.
• The student will be able to demonstrate a basic understanding of an abstract data type.  The student will be able to domonstrate the association between ADT concepts and basic Java constructs.
• The student will be able to demonstrate the correct use and application of trees, binary trees, search trees, and balanced trees.
• The student will be able to demonstrate the correct use and application of 2-3 trees, and B-trees.
• The student will be able to demonstrate the correct use and application of heaps and priority queues.
• The student will be able to demonstrate the correct use and application of hashing.
• The student will be able to demonstrate the correct use and application of maps and sets.
• The student will be able to demonstrate the correct use and application of matircies.
• The student will be able to demonstrate the correct use and application of graphs.

Honor Code: All work turned in for credit, including exams and all components of the project, are to be the work of the student whose name is on the exam or project. For all project components, the student can receive assistance from individuals other than the instructor only to ascertain the cause of errors. Thus you can get help if you need it to figure out why something doesn't work. You just can't get help from anyone, other than the instructor or TA, to figure out how to make something work. All solutions turned in for credit are to be your individual work and should demonstrate your problem solving skills, not someone else's.

The following text should appear on all assignments:
I pledge that I have neither given nor received help from anyone other than the instructor for all program components included here.

The student should sign his or her name under the pledge. Any deviation from this policy is an honor code violation and will be treated as such if detected. It should be included as a comment in your source code and part of your written report.

• First violation: Students must meet with the instructor. In most cases, the grade will be split between the authors of the copied programs.
• Second violation: Students will receive no credit for the assignment. An incident letter will be placed on file in the Computer Science Department.

Class Attendance: Class attendance is expected.

ADA Statement: Students who have special needs or disabilities that may affect their ability to access information and/or material presented in this course are encouraged to contact me or the Director of Disability Support Services, on campus at 963-2171.

Caveat: The schedule and procedures for this course are subject to change. It is the student's responsibility to learn of and adjust to changes.

Last updated: Jun. 19, 2009

All images and text are ©2009 Central Washington University
This material is subject to copyright and unauthorized use or copying is prohibited.