CPSC 335 - Problem Solving Strategies --Computer Science

Institution:

California State University-Fullerton

Subject:

Description:

Description: Prerequisites: Examination in Programming Proficiency , Math 270B and 338. Complexity classes, including undecidable and NP-complete problems. Problem solving strategies applied to parallel and distributed processing, numerical computation, and artificial intelligence. Greedy methods, divide-and-conquer, dynamic programming, approximation, and search methods. Units: 3

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.fullerton.edu

Phone Number:

(657) 278-2011

Regional Accreditation:

Western Association of Schools and Colleges

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.