COM 210 - Algorithms And Data Structures

Institution:

St. Joseph's University New York

Subject:

Description:

This course explores specific classes of problems and their solutions. Fundamental questions concerning computational complexity, data stor- age and access, data encapsulation using objects, space/time bounds, optimal algorithms and data structures including lists, queues and trees are addressed. Algorithms for important classes of problems such as searching, sorting and pattern-matching will be designed, implemented and tested in a laboratory environment. (Corresponds to ACM CS2.) Prerequisite: COM 152 and MAT 203, each with a minimum grade of C-. 3 hours a week, 1 semester, 3 credits. Spring 2008, 2010

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.sjcny.edu

Phone Number:

(718) 940-5300

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

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.