-
Institution:
-
Doane University
-
Subject:
-
-
Description:
-
An introduction to complexity theory, searching and sorting, and techniques of algorithm design, including greedy, divide and conquer, dynamic programming, and backtracking methods. Upon completion of this course, the student will be able to apply these methods in designing algorithms and be able to analyze the efficiency of these algorithms. Prerequisite: IST 146, MTH 330. Offered alternate spring terms.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(402) 826-2161
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Four-one-four plan
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.