CS 306 - Algorithms and Complexity

Institution:

Brigham Young University-Idaho

Subject:

Description:

Prerequisite: CS 235 and CS 238 Introduces formal techniques to support the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of effi ciency. Topics include asymptotic complexity bounds, techniques of analysis, and algorithmic strategies. (Fall, Spring)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.byui.edu

Phone Number:

(208) 496-1411

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.