-
Institution:
-
California State University-Stanislaus
-
Subject:
-
-
Description:
-
(3 Units) A systematic study of the design and efficiency analysis of algorithms. Coverage of fundamental techniques of algorithms such as greedy, divide-and-conquer, dynamic programming, graph techniques, probabilistic, and parallel. An introduction to computational complexity theory: problem reduction, NP-complete problems, and other complexity classes. Prerequisites: CS 3100 and MATH 2300. (Spring)
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(209) 667-3122
-
Regional Accreditation:
-
Western Association of Schools and Colleges
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.