COT 2948 Service Learning Field Study I . . . . . 1-3(VARIABLE)
Placement in community agency or other social organizational setting related to field of study. Supervision by faculty and agency. Students and faculty "customize" courses to fit a full range of services that are available in the setting. Student must be able to draw correlation between the discipline and field study. Journal and reflective experience paper are required. With the agreement of the student's faculty sponsor, a minimum of 6-8 hours per week must be done at the field site per semester hour of credit.

COT 3100 Applications of Discrete Structures . . . . . 3(3,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 developing skills for good programming style. Prerequisite: COP XXXX ( Programming course in ADA, C, C++, PASCAL, or equivalent language); MAC 2233 (CIS majors) or MAC 2311 (CS/CE/EE majors).

COT 3948 Service Learning Field Study II . . . . . 1-3(VARIABLE)
Placement in community agency or other social organizational setting related to field of study. Supervision by faculty and agency. Students and faculty "customize" courses to fit a full range of services that are available in the setting. Student must be able to draw correlation between the discipline and field study. Journal and reflective experience paper are required. With the agreement of the student's faculty sponsor, a minimum of 6-8 hours per week must be done at the field site per semester hour of credit.

COT 4400 Analysis of Algorithms . . . . . 3(3,0)
Computational complexity, big-Oh notation, growth rates of functions. Divide and conquer algorithms, dynamic programming, backtracking algorithms. Application of radix, string, and range searching, sorting, graphs, others. NP-completeness. Offered concurrently with COT 5405; graduate students will be assigned proof-oriented homework and test and a research paper. Prerequisite: COT 3100, COP 3530, MAC 2312.

COT 4420 Theory of Computation . . . . . 3(3,0)
Computational complexity, big-Oh notation, growth rates of functions. Divide and conquer algorithms, dynamic programming, backtracking algorithms. Application of radix, string and range searching, sorting, graphs, others. NP-completeness. Offered concurrently with COT 5315; graduate students will be assigned proof-oriented homework and tests and a research paper. Prerequisite: COT 3100, COP 3530, MHF 3202.

COT 4932 Senior Seminar . . . . . 3(3,0)
Purpose is to provide senior-level students with timely topics of an advanced nature. The content of the course will vary from term to term. Prerequisite: CS major with senior status or permission of the instructor.

COT 5315 Theory of Computation . . . . . 3(3,0)
Computational complexity, big-Oh notation, growth rates of functions. Divide and conquer algorithms, dynamic programming, backtracking algorithms. Application of radix, string and range searching, sorting, graphs, others. NP-completeness. Offered concurrently with COT 4420; graduate students will be assigned proof-oriented homework and tests and a research paper. Prerequisite: COT 3100, COP 3530, MHF 3202.

COT 5405 Analysis of Algorithms . . . . . 3(3,0)
Computational complexity, big-Oh notation, growth rates of functions. Divide and conquer algorithms, dynamic programming, backtracking algorithms. Application of radix, string and range searching, sorting, graphs, others. NP-completeness. Offered concurrently with COT 4400; graduate students will be assigned proof-oriented homework and tests and a research paper. Prerequisite: COT 3100, STA 4321, COP 3530, MAC 2313.

COT 6430 Parallel Languages, Algorithms & Analysis . . . . . 3(3,0)
Advanced language and algorithmic concepts for analyzing parallel programs for distributed concurrent processing. Emphasis on target parallel processors that support shared memory, message-passing and hybrid forms of the two schemes for inter-process communication. Theoretical models measuring the efficiency and performance of parallel programs. Effects of distributed memory and scheduling models on the behavior of parallel programs. Major topics are: foundation, parallel software and parallel architectures. Prerequisite: CDA 6158, COP 5025 and COT 5405.

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

COT 6931 Computer Science Seminar . . . . . 3(3,0)
Offered each spring 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. Prerequisites: Satisfaction of core area requirements.

UWF Home Page	Catalog Table of Contents