Graduate School - Catalog of Studies - University of Arkansas

The Graduate School: Departments and Course Descriptions
must be currently enrolled in CSCE 610V and those following
the non-thesis option must be currently enrolled in, or have
completed, CSCE 620V.
2. The courses CSCE 5033 Design and Analysis of Algorithms
and CSCE 5313 Advanced Operating Systems – designated core
courses, have been completed.
3. The candidate’s cumulative grade-point average on all graduatelevel
courses must be 3.00 or higher.
Requirements for the Doctor of Philosophy Degree: In addition
to the requirements of the Graduate School, the following departmental
requirements must be satisfied by candidates for a Doctor of
Philosophy degree with a major in computer science.
A student is admitted to candidacy by first passing a Ph.D.
Qualifying Examination and then, at a later time, a Candidacy
Examination on the student’s dissertation proposal. The Ph.D.
Qualifying Examination must be passed no later than the end of the
first year of study for students admitted to the program with a master’s
degree and no later than the end of the third year for students
admitted to the program without a master’s degree. The Qualifying
Examination is scored Pass or Fail on each of the four sections of the
examination. If a Fail is assigned on any section of the examination,
then the student must repeat that section at the next administration
of the examination. A second failure will terminate the student’s
course of study in the doctoral program. In preparation for the
Ph.D. Qualifying Examination, a student should refer to the CSCE
Graduate Student Handbook.
Each student must form a doctoral supervisory committee before
registering for dissertation hours. This committee must consist of
faculty who hold qualifying status on the graduate faculty, three
members including the chair of which hold regular or adjunct
appointments in the Department of Computer Science and Computer
Engineering.
For the Candidacy Examination, the student is expected to present
a dissertation proposal. Committee members will judge the proposal
on its scientific merit, originality, and difficulty. Each Ph.D. student
is required to defend a completed dissertation before his or her dissertation
committee.
1. All students must complete a minimum of 78 semester hours
of graduate-level credit beyond the bachelor’s degree, including a
minimumof 48 semester hours of course work and a minimum of 30
semester hours of dissertation research credits.
2. A minimum of 48 semester hours of course work must be at the
graduate level (5000 or above)
3. Upon recommendation of the student’s advisory committee, a
student who has entered the Ph.D. program after a master’s degree
may receive credit for up to 30 semester hours. If the 30 hours
includes master’s thesis research, the advisory committee may credit
up to six hours of thesis research toward the minimum dissertation
research requirement.
4. Complete a minimum of nine semester credit hours of course
work in a set of coherent courses in a related subject area approved
by the student’s advisory committee.
5. Earn a minimum cumulative grade-point average of 3.0 on all
graduate courses attempted.
6. Satisfactorily pass both a written and oral qualifying examination.
7. Complete and defend a dissertation on some topic in the student’s
major field of study.
8. Satisfactorily pass a final comprehensive oral examination.
Computer Sci/Computer Engr (CSCE)
CSCE5003 Advanced Programming Languages (Irregular) Abstraction, proof of
correctness, functional languages, concurrent programming, exception handling, dataflow and
object oriented programming, denotational semantics. Prerequisite: graduate standing.
CSCE5013 Advanced Special Topics in Computer Science (Irregular)
Consideration of current computer engineering topics not covered in other courses.
CSCE5023 Architecture of Computer Systems (Irregular) An advanced study
of both classical and recent computer hardware and software systems. Prerequisite: graduate
standing.
CSCE5033 Design and Analysis of Algorithms (Sp) Design of computer algorithms,
with primary emphasis on the development of efficient implementation. Prerequisite:
graduate standing.
CSCE5043 Artificial Intelligence (Irregular) In-depth introduction to AI. Topics
include: philosophical foundations, cognition, intelligent agents, AI languages, search, genetic
algorithms, first order and modal logic, inference, resolution, knowledge representation,
ontologies, problem solving, planning, expert systems, uncertainty, probabilistic reasoning,
fuzzy logic, machine learning, natural language processing, machine vision, and robotics.
Prerequisite: graduate standing.
CSCE5123 Database Management Systems (Fa) In-depth introduction to database
management systems. Topics include: architecture, schemas, data sources, file structures,
indexing, data models (relational, hierarchical, network, entity relationship, object-oriented),
query languages, views, relational algebras, SQL, optimization, user interfaces, ODBC, transaction
management, concurrency control, recovery, integrity, security, and commercial trends.
Prerequisite: CSCE 2143 or CENG 2143 and graduate standing.
CSCE5203 Advanced Database Systems (Sp) Topics include: object databases,
distributed databases, XML query, data warehouses, network as database systems, peer-peer
data sharing architectures, data grids, data mining, logic foundations, semantic databases,
spatial and tempral databases, and knowledge bases. Prerequisite: CSCE 5123 and graduate
standing.
CSCE5213 Intorduction to Bioinformatics (Irregular) Application of algorithmic
techniques to the analysis and solution of biological problems. Topics include an introduction
to molecular biology and recombinant DNA technology, biological sequence comparison, and
phylogenetics, as well as topics of current interest. Prerequisite: Instructor consent. (Same as
BENG 5213)
CSCE5233 Principles of Compiler Construction (Irregular) Lexical analysis,
parsing, symbol table construction, intermediate code generation, run-time simulation.
Prerequisite: graduate standing.
CSCE5243 Formal Languages (Irregular) An advanced continuation of CSCE 4323.
Prerequisite: CSCE 4323 and graduate standing.
CSCE5263 Computational Complexity (Irregular) Turing machines, recursion
theory and computability, complexity measures, NP-completeness, analysis on NP-complete
problems, pseudo-polynomial and approximation. Prerequisite: graduate standing.
CSCE5283 Graph and Combinatorial Algorithms (Irregular) A study of algorithms
for graphs and combinatorics with special attention to computer implementation and
runtime efficiency. Prerequisites: graduate standing or instructor consent.
CSCE5303 Parallel Programming (Irregular) An analysis of parallel computer systems
with respect to software engineering. Practical programming experience on pipelined,
array, and multi-processor computers. Prerequisite: CSCE 4413 or equivalent and graduate
standing.
CSCE5313 Advanced Operating Systems (Irregular) Concurrent processes and
process communication; mutual exclusion and synchronization principles; kernel philosophy;
resource allocation and deadlock; and case studies of specific operating systems. Prerequisite:
CSCE 4413 or equivalent and graduate standing.
CSCE5323 Computer Security (Fa) Study of a broad selection of contemporary
issues in computer security. Topics include access control, security policies, authentication
methods, secure system design, and information assurance. Prerequisite: CSCE 4413.
CSCE5333 Computer Forensics (Sp) Various methods for identification, preservation,
and extraction of electronic evidence at a computer crime scene. Specific topics include auditing
and investigation of network and host instrusions, computer forensics tools, resources for
system administrators and information security officers, legal issues related to computer and
network forensics. Prerequisite: CSCE 5323.
CSCE5513 Intelligent Robot Control (Irregular) This course is designed to examine
software issues surrounding the creation and control of autonomous robots. Techniques
include: genetic programming, artificial neural networks, reinforcement learning, and symbolic
methods. Programs are run in simulation and on actual robotic controllers. Topic discussed
include visual processing, spatial mapping, and learning. Prerequisite: graduate standing
CSCE5523 Multiagent Systems (Irregular) Multiagent systems is the study, construction,
and application of systems in which several interacting software (or software and
human) agents pursue some set of goals or some set of tasks. The course covers agent
architectures; multiagent problem-solving and planning; multiagent communication; multiagent
search; multiagent learning; reasoning about action, plans, beliefs and knowledge; coordination;
cooperation and competition; teamwork; and multiagent decision-making. Application
examples are presented in e-commerce, scheduling, robotics, control, information retrieval,
manufacturing and logistics.
CSCE5713 Multimedia Systems Design (Irregular) Overview of digital unified
multimedia. Programming methodology involved in integration of all forms of digitized information
(e.g., text, sound, graphics, animation, and process control) in a single computer-based
interactive environment. Prerequisite: graduate standing.
CSCE5723 Client-Server Computing (Irregular) Advanced Object Oriented methods
for designing software systems for network applications. Topics include implementations of
distributed object models, remote database connectivity. Server side programming, and reusable
components. Prerequisite: CSCE 5743 and graduate standing.
CSCE5733 Information Agency (Irregular) Study of software agents and their
deployment on the internet: precursors to agents - viruses and worms, origins of software
agents, delegate vs. representative agents, agency of the Internet and Web, operational
guidelines for agents, HTTP, transaction security, MUD agency, intelligent agency, applications
of agents: indexers, resource managers, search utilities, and commercial applications.
Prerequisite: graduate standing.
CSCE5743 Object Oriented Programming for the Internet (Irregular) Object
oriented design and programming for Internet client/server applications. Basics of the Internet,
University of Arkansas, Fayetteville • Graduate Catalog 81