CS 226 - Data Structures Using Collections

Institution:

University of New Haven

Subject:

Computer Science

Description:

Prerequisite: CS 210 ; for non-CS majors, CS 166 is also recommended. Intermediate program design and debugging in Java. The nature and application of data structures such as arrays, stacks, queues, priority queues, and trees. Evaluation of the performance of different data structures for typical applications. Students will write and debug several projects using Java's built-in class library; classes covered include sets, maps, hash tables, trees, array-based lists, linked lists, stacks, and vectors.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.newhaven.edu

Phone Number:

(203) 932-7000

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Four-one-four plan

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.