-
Institution:
-
Eastern Washington University
-
Subject:
-
-
Description:
-
Prerequisites: CSCD 320 and MATH 301 or CSCD 310 or equivalent. The study of algorithms: asymptotic analysis of computing time and space requirements. Strategies for designing algorithms: divide-and-conquer, greedy method, backtracking and others. Analysis of graph algorithms. Introduction to parallel algorithms and their analysis. Further topics may be covered, as time permits, such as techniques for algebraic manipulations, lower bound theory and NP-complete problems.
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(509) 359-6200
-
Regional Accreditation:
-
Northwest Commission on Colleges and Universities
-
Calendar System:
-
Quarter
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.