COT-COMPUTING THEORY

COT 3100 Applications of Discrete Structures . . . . . . 3(3,0,0)
Sets, relations, functions, and concept of cardinality. Propositional logic and applications. Predicate logic. Induction and recursion. Finite state machine, grammar and languages. Lists, trees, graphs, and boolean algebra. Emphasis is on analyzing programs and developing programming skills. MAC 2233 is for CIS majors, MAC 2311 is for CS/CE/EE majors. Permission of instructor is required. Prerequisite: COP xxxx ( Programming course in ADA, C, C++, PASCAL, or equivalent language). Corequisite: CIS 3020.

COT 4400 Analysis of Algorithms . . . . . . 3(3,0,0)
Computational complexity, big-Oh notation, growth rates of functions, probabilistic analysis. Divide and conquer algorithms, dynamic programming, and greedy algorithms. Radix, string and range searching and sorting. Elementary numerical and matrix algorithms, Fast Fourier Transform, Concept of NP-completeness. STA 4321 is for CS/CE/EE majors. STA 2023 is for CIS majors; MAD 3XXX (Mathematics of Computation) is for CS/CIS majors or both MAS 3105 and MAC 2313 is for CE/EE majors. Prerequisite: COP 3530; STA 4321 or STA 2023; MAD 3XXX, or both MAS 3105 and MAC 2313.

COT 4420 Theory of Computation . . . . . . 3(3,0,0)
Theoretical foundations of computer science. Classification of formal languages, grammars, and automata. Parsing and recognition of syntactic expressions. Turing Machines and random access machines. Church-Turing thesis. Unsolvability of the halting problem.  Prerequisite: COT 3100, COP 3530, and COP 4020.

COT 4932 Senior Seminar . . . . . . 3(3,0,0)
Purpose is to provide senior-level students with timely topics of an advanced nature. Content will vary from term to term. CS major with senior status is required.

COT 6415 Computation and Complexity . . . . . . 3(3,0,0)
Provides a foundation in theoretical computer science. The basic theorems of recursion theory, as well as the concepts of reducibility and MP-completeness, are covered in detail. Applications of logic, combinatorics, and graph theory in computer science are stressed. Selected advanced topics may include randomization, approximation, parallelism, and oracle methods. Prerequisite: COT 4400 and COT 4420.

COT 6930 Advanced Topics in Computer Theory . . . . . . 3(3,0,0)
Selected topics in the theory of computation. Prerequisites will vary according to specific subject material to be covered.

COT 6931 Computer Science Project . . . . . . 3(3,0,0)
Offered to project option MSCS/CS students and others. Assignments range from individual reading and research to group computing project, depending on the interests of both the instructor and students. Requires an extensive written technical report concerning the project. Satisfaction of core area requirements and permission of instructor is required.