Study of emerging research and methods in computer science. A review and extension of selected topics in the current literature. When the course if offered, a specific title with specific credits, the number of hours in lecture-discussion and laboratory will be announced. Lecture/discussion, two-four hours; laboratory, zero-four hours per week. May be repeated up to the discretion of the department.

Current approaches -- practice and technologies -- for developing reliable software: specifications, testing, and verification. Individual and team assignments focused on applying these approaches to software systems. A significant communication and composition component related to specifying, designing, presenting, and documenting software systems.

Projects to design and implement complex systems of current interest to computer scientists. Students will work in small groups. This course is a Graduation Composition and Communication Requirement (GCCR) course in certain programs, and hence is not likely to be eligible for automatic transfer credit to UK.

Projects to design and implement complex systems of current interest to computer scientists. Students will work in small groups. This course is a Graduation Composition and Communication Requirement (GCCR) course in certain programs, and hence is not likely to be eligible for automatic transfer credit to UK.

The design and analysis of efficient algorithms and data structures for problems in sorting, searching, graph theory, combinatorial optimization, computational geometry, and algebraic computation. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy method, and randomization, approximation algorithms.

Review of basic linear algebra from a constructive and geometric point of view. Factorizations of Gauss, Cholesky and Gram-Schmidt. Determinants. Linear least squares problems. Rounding error analysis. Stable methods for updating matrix factorizations and for linear programming. Introduction to Hermitian eigenvalue problems and the singular value decomposition via the QR algorithm and the Lanczos process. Method of conjugate gradients.

Three-dimensional graphics primatives such as 3D viewing, lighting, shading, hidden line/surface removal, and more advanced topics such as solid modeling, image storage and representation, advanced raster graphics architecture and algorithms, advanced modeling techniques, and animation will be covered.

Brief review of classical operating systems concepts device drivers, file systems, starvtion/deadlock). Modern topics of file systems (log-structured file systems, distributed file systems, memory-based file systems), operating system design (monolithic, communication-kernel, extensible/adaptable, distributed shared memory), multiprocessor issues attacks, encryption, defenses). Inspection and modification of actual operating system code (Linus).

This course introduces students to the state of the art of network security problems and solutions. Topics include security issues in computer networks, the Public Key Infrastructure ecosystem, key exchange protocols, and security mechanisms and protocols at the application, transport, network and data link layers. It will also discuss up-to-date development in the field of network security.

Topics to be selected by staff. May be repeated to a maximum of six credits, but only three credits may be earned by a student under the same topic.