CSCI 247,248 - Data Structures And Algorithms I And II

Institution:

Widener University-Main Campus

Subject:

Description:

Stacks, queues, linked lists, trees, and heaps are treated theoretically and in the context of the Java language. The course includes an introduction to Java. Complexity analysis of algorithms including sorting and searching algorithms, graph algorithms, and recursion. Three hours lecture; one hour laboratory. Prerequisite for CSCI 247: CSCI 152 or CSCI 143. Corequisite for CSCI 247: MATH 151. Prerequisite for CSCI 248: CSCI 247 and MATH 151. 4 semester hours each

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Multiple

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.widener.edu

Phone Number:

(610) 499-4000

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.