-
Institution:
-
University of South Carolina-Aiken
-
Subject:
-
-
Description:
-
(Prereq: Grade of C or better in CSCI A220 and MATH A141) An introduction to the design and analysis of fundamental algorithms in computer science. The algorithmic design paradigms such as the greedy method, divide and conquer, dynamic programming, backtracking, and branch-and-bound. The analyses of algorithms from different areas such as searching, sorting, graph theory, combinatorial optimization, and computational geometry. An introduction to the theory of NP-completeness.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(803) 648-6851
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.