-
Institution:
-
Baker University
-
Subject:
-
-
Description:
-
Approaches to analyzing algorithm complexity, introduced in Introduction to Computer Science will be reviewed. The complexity class of algorithms will be introduced as one of the major considerations in problem analysis and program design. The use of abstract data types as a design technique, and their implementation in solutions to problems, will form a part of the practical work. Code will be implemented in the form of reusable C++ classes. The concept of "efficient" code and ways to measure efficiency (both empirically, by timings, and theoretically, in terms of formal models), will be studied. Prerequisite: CS 175.
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(800) 873-4282
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.