CMSC 121 - Computer Science II

Institution:

Marist College

Subject:

Description:

Three Credits LA The concept of data abstraction as applied to elementary stacks, queues, linked lists, and binary trees will be introduced and implemented in an object-oriented language. Recursion as a programming tool will be introduced and employed in the development of linked list and binary tree algorithms. Searching and sorting algorithms will be studied and compared in terms of space and time complexity. The notions of algorithm complexity and program correctness will be introduced and discussed at appropriate points. Offered every semester. Prerequisite: CMSC 120

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.Marist.edu

Phone Number:

(845) 575-3000

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.