CSCI370
Download as PDF
Algorithm Analysis and Computability
Course Subject Code
CSCI
Course Number
370
Status
Active
Course Short Title
Alg Analysis and Computability
Course Long Title
Algorithm Analysis and Computability
Course Description
Develops methods for the analysis of time and space efficiency using Asymptotic notations with formal deduction and proof methods. Compares brute-force algorithms with divide-and-conquer algorithms, greedy methods, and dynamic programming on various topics such as search problems, string problems, and graph problems. Introduces NP-completeness and intractability through Finite-State machines, Turing machines, determinism and non-determinism, Chomsky hierarchy, Church’s thesis, unsolvability, and reducibility.
Min
4
Max
-
Operator
-
Repeatable
-
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
Equivalent Course(s)
-