CAP 5605
Artificial Intelligence (3)
Prerequisite: COP 4530. Introduction, representing knowledge, controlling attention, exploiting constraints, basic LISP programming, basic graph searching methods, game-playing and dealing with adversaries, understanding vision, theorem proving by computer, computer programs utilizing artificial intelligence techniques.
CDA 5155
Computer Architecture (3)
Prerequisite: CDA 3101
Computer system components; microprocessor and minicomputer architecture; stack computers; parallel computers; overlap and pipeline processing; networks and protocols; performance evaluation; architecture studies of selected systems.
CEN 5000
Knowledge Management and Data Engineering (3)
Prerequisite: COP 5710
A survey of techniques and tools representing the transition from database management to knowledge management; database architecture and models; fuzzy databases; construction of knowledge bases.
CEN 5035
Software Engineering (3)
Prerequisites: CEN 4010, COP 4020, 4531
Survey of software engineering and a detailed study of topics from requirements analysis and specification, programming methodology, software testing and validation, performance and design evaluation, software project management, and programming tools and standards.
CEN 5055
Project Development (3)
Prerequisite: CEN 5035
This course deals with the planning, design, validation and implementation of a large scale project using IEEE deliverables, state-of-the-art software engineering techniques, and analysis and design project reviews and evaluations prior to implementation in the Graduate Software Project.
CIS 5900r
Directed Individual Study (1–4)
(S/U grade only)
May be repeated to a maximum of twelve (12) semester hours.
CIS 5930r
Selected Topics in Computer Science (1–3)
May be repeated to a maximum of twelve (12) semester hours.
CIS 5935
Introductory Seminar on Research (2)
(S/U grade only)
A series of lectures given by faculty on the research being conducted by the Department of Computer Science. Other lectures include guidelines on the preparation of the doctoral portfolio, and on the use of library research tools.
COP 5517
Generic Programming (3)
Prerequisite: COP 4530.This course covers all fundamental aspects of generic programming, including generic algorithms, generic iterators, as well as function and predicate objects. Examples are drawn from the FSU and STD template libraries, while techniques for extending these support libraries are covered in the context of a template-graph library. Policy-based design is then used to create generic implementations of several design-pattern implementations, including singleton, smart pointer, and abstract factory.
COT 5405
Advanced Algorithms (3)
Prerequisite: COP 4531
This course covers algorithms, formal proofs of correctness, and time complexity analysis for network flow problems, approximation of NP hard combinatorial optimization problems, parallel algorithms, cache-aware algorithms, randomized algorithms, computational geometry, string algorithms, and other topics requiring advanced techniques for proof of correctness or time/space complexity analysis.