Untitled - University of New Orleans

who elect to fulfill the thesis degree requirements. Section number
will correspond with credit to be earned.
CSCI 6101 Theory of Algrthm & Complexity
3 cr.
Prerequisites: CSCI 4101 or consent of department. Advanced study
of algorithms and their complexity; the notions of time and space
complexity; design methods, including divide and conquer, and the
greedy method; polynomial and nondeterministic polynomial algorithms;
the class of NP-complete algorithms.
CSCI 6110 Appl Combinatorics & Grph Thry
3 cr.
Prerequisites: CSCI 4101 or consent of department. A study of combinatorial
and graph theoretic techniques for complexity analysis.
Includes generating functions, recurrence relations, Polya’s theory
of counting, planar directed and undirected graphs, and NP-complete
problems of combinatorial or graph-theoretic nature. Application
of techniques to analysis of algorithms in graph theory, as
well as more general problems, such as sorting and searching.
CSCI 6120 Theory of Computation
3 cr.
Prerequisites: CSCI 3102 or consent of department. A survey of formal
models for computation. Includes Turing machines, partial
recursive functions, recursive and recursively enumerable sets, the
recursion theorem, Church’s thesis, Godel numbering, computational
complexity, uncomputability, intractability, and unsolvability.
CSCI 6130 Data Encrypt/Cryptology
3 cr.
Prerequisites: CSCI 4101 and MATH 2511 or consent of instructor. A
study of the methods used in data encryption and related cryptologic
problems. The history of early cryptography, including the
Caesar shift, Vigenere table, Playfair square, and Enigma machines.
Modern cryptographic problems, including the Data Encryption
Standard, the key management problem, the public-key encryption,
knapsack methods, number-theoretic methods, and the Rivest-
Shamir-Adelman public-key cryptosystem, digital signature, the
Digital Signature Standard, and cryptanalysis of knapsacks. Other
cryptologic problems, including threshold schemes, zero-knowledge
protocols, mental poker, and implementations on uniprocessor
machines, networks, and parallel machines.
CSCI 6140 Formal Languages
3 cr.
Prerequisite: CSCI 4103 or consent of department. Theory and application
of formal language systems and automata. Emphasis will
be placed on formal systems, the languages they generate, and
techniques used to parse strings in those languages.
CSCI 6230 Distributed Database Systems
3 cr.
Prerequisites: CSCI 4125 and 4311 or consent of department. A consideration
of the problems and opportunities inherent in distributed
databases on a network computer system. Includes distributed
database design, optimization of access strategies, distributed
concurrency control, recovery in distributed databases, distributed
database administration, commercial systems.
CSCI 6330 VLSI Circuit Design
3 cr.
Prerequisite: CSCI 4302 and 4401. A review of microelectronics and
an introduction to MOS technology, basic electrical properties of
MOS circuits, MOS circuit design processes, subsystem design and
layout, scaling of MOS circuits, aspects of system design and timing,
structured design and testing, MOS design projects.
CSCI 6331 Advanced VLSI Design
3 cr.
Prerequisite: CSCI 6330 or consent of department. Design of large
digital VLSI (Very Large Scale Integration) systems using modern
CAD tools and state-of-the-art testing and characterization
systems.
CSCI 6340 Parallel Machines
3 cr.
Prerequisite: CSCI 4401 and 4302 or consent of department. An
investigation of modern parallel processing computers and generally
those designed on non-vonNeumann architectures.
CSCI 6350 Dev of Distributed Software
3 cr.
Prerequisite: CSCI 4401 or consent of the department. This course
provides a systematic study of concepts, methodologies, models and
methods that specifically address problems in the development
of distributed software. The topics include architectural design
for distributed applications, distributed object models, interface
definition languages, concurrent task structuring, modeling for
dynamic behavior, and static analysis and debugging for distributed
programs.
CSCI 6361 Topics in Mobile Computing
3 cr.
Prerequisite: CSCI 4401 or consent of department. This course provides
an introduction to major topics in mobile computing, including
software engineering issues for resource-constrained devices
(e.g. cellular phones, palmtops), mobile databases, fault tolerance,
service discovery, and wireless networking. The course has substantial
theoretical and applied components. Students will be required
to develop a non-trivial mobile application and prepare a class
presentation on a topic in mobile computing.
CSCI 6401 Concurrent Programming
3 cr.
Prerequisite: CSCI 4401 or consent of department. A systematic
study of concepts, theories, methods and algorithms that specifically
address problems in distributed programming. Topics include
concurrency, interference, monitors and distributed programming
issues, such as: synchronous and asynchronous message passing,
remote procedure call, and rendezvous.
CSCI 6410 Performance Analysis Comp Syst
3 cr.
Prerequisite: CSCI 4401 or consent of the department. This course
will examine models for the analysis of performance of computer
systems. Topics include stochastic processes, discrete and continuous
Markov chains, queuing models, and stochastic Petri models. These
models will be applied to uni- and multiprocessor systems, including
crossbar multiprocessor architectures, single- and multi-bus
multiprocessors with external and distributed common memory.
CSCI 6411 Top Fault Tolerance Reliability
3 cr.
Prerequisite CSCI 4401 or consent of department. This course provides
an introduction to major topics in fault tolerance and reliability,
concentrating on distributed systems. These topics include
failure modes, failure detection, logical time systems for distributed
systems, N-version programming, checkpointing, optimistic and
pessimistic logging schemes, software engineering issues in designing
fault tolerant and reliable software, and schemes for reliable
communication. Students will be required to develop a non-trivial
reliable distributed application and prepare a class presentation on
a topic in reliability .
CSCI 6450 Principles Distributed Systems
3 cr.
Prerequisite: CSCI 4401. A study of the concepts and design principles
used in the construction of distributed computer systems.
Topics include architecture and design goals; distributed time management;
state and deadlock detection; name resolution; synchronization,
mutual exclusion, and communication; collaborating servers;
protection and security; error recovery.
CSCI 6501 Formal Methods Prog Language
3 cr.
Prerequisite: CSCI 4501. Formal definitions and specifications for the
semantics of programming languages including lambda-calculus,
domain theory, and denotational descriptions of common programming
language concepts.
University of New Orleans/181