CSE 381Algorithms and Complexity

Brigham Young University-Idaho · 3.00 credits · UGRD

Catalog

Introduces formal techniques to support the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include asymptotic complexity bounds, techniques of analysis, and algorithmic strategies. The following will be done with numerous algorithms used in modern computing solutions: Research the algorithm using AI tools to complement required reading and classroom activities; Explain the details of the algorithm methodology and performance; Implement the algorithm in an imperative programming language.

Recent sections

Fall 2026 · 2 sections

Sep 14 – Dec 16

SectionDays & timeLocationInstructor
01Class #2026;FA-CSE 381-01Mo We Fr · 12:45 – 1:45 PMScience & Technology Ctr 367Comeau, Luc V.
01 notes: Instructional method: In-Person
A1Class #2026;FA-CSE 381-A1Time not publishedWEB - Online Class WEBPeck, Emelyne
A1 notes: Instructional method: Online