-
Institution:
-
Clemson University
-
Subject:
-
Computer Science
-
Description:
-
Basic techniques for design and analysis of algorithms; models and techniques for obtaining upper and lower time and space bounds; time/space trade-offs; inherently difficult problems. Students are expected to have completed coursework in discrete mathematics before enrolling in this course.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(864) 656-4636
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.