uwf banner 2004-2005 CATALOG  
Table of Contents
Welcome
Telephone Directory
Academic Calendars
     Year 2004/2005
     Fall Semester 2004
     Spring Semester 2005
     Summer Semester 2005
University Mission
Accreditations
Degrees, Areas of Specialization,
Minors

Admissions
After Admission
Financial Assistance
Student Activities
Student Services and Resources
Tuition and Fees
Military and Veterans Information
Registration and Records
Academic Policies
Graduation and General Degree
Requirements

Public Service and Research Centers
College Mission Statements
Undergraduate Degree Programs
Master's Degree Programs
Specialist Degree Programs
Doctoral Degree Programs
Course Numbering System
Course Listings and Descriptions
Administration
Faculty
Index
Course Listings/Descriptions
Semester offering codes corrected and posted on June 7, 2004.
COT-Computing Theory

COT 3100 Applications of Discrete Structures . . . . . 3(F,S,SS)
Prerequisite: COP 2253, MAC 2311 or MAC 2233. Pre/Corequisite: CIS 3020 or COP 3022.
Sets, relations, functions, and the concept of cardinality. Propositional logic and applications. Predicate logic, induction and recursion. Finite state machines, grammar and languages. Lists, trees, graphs, and boolean algebra. Emphasis is on analyzing programs and developing programming skills.

COT 4400 Analysis of Algorithms . . . . . 3(F,S)
Prerequisite: COP 3530 and MAD 3107.
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.

COT 4420 Theory of Computation . . . . . 3(F,S)
Prerequisite: COP 3530 and MAD 3107.
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.

COT 6415 Computation and Complexity . . . . . 3(S)
Prerequisite: COT 4400, COT 4420.
Provides a foundation in theoretical computer science. The basic theorems of recursion theory, as well as the concepts of reducibility and NP-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.

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

COT 6931 Computer Science Project . . . . . 3(S)
Prerequisite: Completion of any three graduate core courses: CDA 6158, CEN 6064, CEN 6520, COP 6025, COP 6611.
Offered to project option MSCS/CS students. 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. Not open to Software Engineering specialization graduate students. Permission is required.