Search Results

CS 277 Algorithms and Analysis 3.0 Credits

Introduces foundational concepts in Computer Science theory, including computability, decidability, the Turing Machine, and algorithmic complexity. Applies concepts underlying graph theory and automata to current topics in computing to create contextualized connections between theory and practice.

College/Department: College of Computing and Informatics
Repeat Status: Not repeatable for credit
Prerequisites: CS 260 [Min Grade: C] and CS 270 [Min Grade: C] and MATH 221 [Min Grade: C]

Minor in Computer Science

...additional CS courses include CS 277 and CS courses numbered 300 or higher (excluding CS...

  • Schedule of Classes
  • All Course Descriptions
  • Co-op
  • Academic Advising
  • Admissions
  • Tuition & Fees