Catalog description: The course covers the following concepts: Basic data structures, graphs, search paths and spanning trees; algorithm design and analysis of sorting, merging and searching; memory management, hashing, dynamic storage allocation; integration of data structures into system design. Prerequisite: CS202.

Course Content: The following topics will be covered in CS370:

Rationale for the course: This is the third semester programming class. This is the equivalent of the data structures module recommended by the ACM (Association of Computing Machinery) as part of a computer science degree curriculum.

Skills and background required or expected: The student should have moderately advanced programming skills from 2 semesters of programming.

Teaching methodologies and anticipated class size: The course meets 3 hours a week for 16 weeks. 15 to 20 students are expected.

Additional course descriptors: none.

Learning objectives for students: Upon course completion, students can program advanced Java applications incorporating advanced data structures. They can analyze the asymptotic behavior of algorithms for efficiency.

Methods of evaluation: Half of the course grade will come from weekly homework assignments. The remaining half of the grade will be based on attendance, one midterm exam and one final exam, used to assess basic mastery of the course material.

Required and recommended texts and/or study guides:

Subsequent courses: CS403, CS410.