Skip to main content

CSCI370

Algorithm Analysis and Computability

Mathematics & Computer Science College of Liberal Arts

Course Subject Code

CSCI

Course Number

370

Status

Active

Course Attributes

CEA: ProgCLA-CEA and Au Pair, EMCR: Major-Cybersecurity Elective, ENCO: Minor-Computer Sci Elective, MCOS: Major-Computer Science, MCYB: Major-Cybersecurity, NCOM: Minor-Computer Science

Course Short Title

Algorithm Analysis and Computa

Course Long Title

Algorithm Analysis and Computability

Course Description

Develops methods for the analysis of time and space efficiency, comparison of brute-force algorithms with divide-and-conquer algorithms, tree algorithms, graph algorithms, string algorithms, dynamic programming, and greedy methods. Introduces NP-completeness and intractability, Turing machines, Church’s thesis, determinism and non-determinism, unsolvability, reducibility, and search and constraint satisfaction.

Min

4

Repeatable

-

Equivalent Course(s)

-