-
Institution:
-
University of North Carolina at Pembroke
-
Subject:
-
-
Description:
-
This course covers time and space complexity of algorithms. Survey of various design techniques such as "divide and conquer" and the "greedy" method is covered. Program verification and validation well as NPComplete and NPHard problems are discussed. Credit, 3 semester hours. PREREQ: CSC 2850, and MAT 2220.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(910) 521-6000
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.