-
Institution:
-
Merrimack College
-
Subject:
-
-
Description:
-
Introduction to the basic principles and techniques for analyzing and designing algorithms. A discussion of the asymptotic complexity of algorithms using standard measures in the best, average and worst cases. Applications of the basic principles and techniques and study of upper and lower bounds of standard computer science problems including: searching, sorting, graph, string matching, polynomial, and matrix algorithms. An introduction to the NP-completeness problem. Prerequisites: MA 114A, MA 118A and CS 162A. Three hours a week.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(978) 837-5000
-
Regional Accreditation:
-
New England Association of Schools and Colleges
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.