Mar 12, 2026  
2026-2027 Undergraduate and Graduate Catalog 
    
Catalog Navigation
  Catalog Home
  Introduction to the University
  Academic Colleges & Offices
  Programs of Study
  Undergraduate Minors
  General Education Curriculum
  Course Descriptions
  Undergraduate Studies
  Graduate School
  University Regulations & Policies
  Services, Facilities, & Activities
  Undergraduate Degree Requirements
  My Catalog
HELP
2026-2027 Undergraduate and Graduate Catalog
Add to Catalog (opens a new window)

CMPS 340 - Design and Analysis of Algorithms

Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0
Algorithm analysis and asymptotic notation. Advanced data structures analysis. Design and analysis of: divide-and-conquer algorithms, dynamic programming, greedy algorithms, and amortized analysis; multi-threaded algorithms, linear programming, number-theoretic algorithms, computational geometry, approximation algorithms, and foundational algorithmic techniques relevant to AI/ML applications.

Course Attribute: ASRE

Repeatable Course: No

Prerequisite(s): CMPS 261  and (MATH 270  or MATH 272 ) both with a grade of “C” or better

MAX number of credit hours applicable to degree: 3


Add to Catalog (opens a new window)