-
Institution:
-
Colorado School of Mines
-
Subject:
-
-
Description:
-
Divide-and-conquer: splitting problems into subproblems of a finite number. Greedy: considering each problem piece one at a time for optimality. Dynamic programming: considering a sequence of decisions in problem solution. Searches and traversals: determination of the vertex in the given data set that satisfies a given property. Techniques of backtracking, branch-andbound techniques, techniques in lower bound theory. Prerequisite: CSCI262, MATH213, MATH223 or MATH224, MATH/CSCI358. 3 hours lecture; 3 semester hours.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(303) 273-3000
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.