-
Institution:
-
Saint Michael's College
-
Subject:
-
-
Description:
-
Covers basic algorithm techniques (such as divide and conquer, greedy algorithms, and dynamic programming) as well as probabilistic algorithms and other optimization techniques. Searching, sorting, hashing, string pattern matching and graph algorithms will be examined and analyzed, and many different approaches will be presented for determining the fastest possible problem solving strategy for a significant number of diverse applications. Prerequisites: CS 211, MA 208 Credits: 3 cr.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(802) 654-2000
-
Regional Accreditation:
-
New England Association of Schools and Colleges
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.