Here is a list of the junior level courses currently available in computer science. Not every course is offered every year - the department rotates the topics so that each area is represented at least once every two years.
This course gives an overview of numerous fundamental areas in computational biology: computational sequence analysis, sequencing technologies and algorithms, protein structure prediction and determination, systems biology and phylogenetic analysis. These areas are covered with a focus on understanding why and how engineering and computational methods are applied to real-world biological questions.
CMPS 1600, CMPS 2200.
An introduction to computer graphics techniques and hardware. Topics will cover geometric transformations, projections, raster algorithms, 3D object models (surface and volume), visible surface algorithms, texture mapping, lighting/shading, software systems (OpenGL/WebGL), ray-tracing, anti-aliasing, and compositing.
CMPS 1600, CMPS 2170, and an introductory knowledge of vector and matrix mathematics required. Prerequisite can be waived with permission of the instructor.
An introduction to how graphical representations of data can be used to aid understanding. This course details the theory and practice of designing effective information or scientific visualizations. The techniques learned in this class have wide applications to all fields in engineering and science, where due to increasing sizes and complexity data now demands effective presentation and analysis. Topics will include iso-surfacing, volume rendering, transfer functions, vector/tensor fields, topological analysis, large data visualization, and uncertainty in visualizations.
CMPS 1600. Prerequisite can be waived with permission of the instructor.
This course provides an introduction to geometric algorithms and geometric data structures. Computational Geometry is a young discipline which enjoys close relations to mathematics and to various application areas such as geometric databases, molecular biology, sensor networks, visualization, geographic information systems (GIS), VLSI, robotics, computer graphics and geometric modeling. Covered topics include fundamental geometric algorithm design and analysis paradigms, geometric data structures for planar subdivisions and range searching, algorithms to computer the convex hull, Voronoi diagrams, and Delaunay triangulation, as well as selected advanced topics.
CMPS 2200 or permission of the instructor.
The aim of this course is to provide the student with an introduction to the main concepts and techniques playing a key role in the modern arena of artificial intelligence. In addition to covering the main topics that concern modern AI, particular attention will be devoted to its applications in several fields. Among the topics covered are, “What is an intelligent artificial agent?”, problem solving using search and constraint satisfaction, uncertainty, Bayesian networks and probabilistic inference, supervised learning, planning, sequential decision problems, as well as several additional topics.
CMPS 1500, CMPS/MATH 2170.
Over the last few decades, as we have been able to determine whole genome sequences, structural biologists have sought to determine and catalog protein structures with an increasing reliance on computational methods. Automated methods to analyze protein structure make it possible to leverage information from previously solved structures, and to interpret experimental data in a principled way. In this course, we will focus on the myriad of algorithms for analyzing numerous aspects of protein structure and protein-protein interactions.
CMPS 1600, CMPS 2200.
This course provides an introduction to the fundamental concepts of machine learning and statistical pattern recognition. In addition, several examples of applications will be described. The topics covered include generative/discriminative and parametric/non-parametric supervised learning, including neural networks; unsupervised learning, including clustering, dimensionality reduction and kernel methods; learning theory, including tradeoffs, large margins and VC theory; reinforcement learning, including criteria for optimality, brute force methods, value function methods and direct policy search; feedforward/feedback adaptive control, direct/indirect adaptive control methods; and various applications.
CMPS 1500, CMPS/MATH 2170.
This course is an introduction to the theory of computation. It begins with regular languages and their representation as finite state automata, and continues with context free languages and pushdown automata. Turing machines and the Church-Turing Thesis are also considered, as well as decidability and reducibility. The basic notions of complexity theory area also covered, including P and NP for time complexity, as well as basic results about space complexity. (Same as MATH 3250.)
CMPS/MATH 2170 or equivalent.
This course is an introduction to the theory of computation. It begins with regular languages and their representation as finite state automata, and continues with context free languages and pushdown automata. Turing machines and the Church-Turing Thesis are also considered, as well as decidability and reducibility. The basic notions of complexity theory area also covered, including P and NP for time complexity, as well as basic results about space complexity. (Same as MATH 3260.)
CMPS/MATH 2170 or equivalent.
This course is an introduction to Shannon’s mathematical theory of information. It considers basic concepts such as information content, entropy and the Kullback-Leibler distance, as well as areas such as data compression and Shannon’s Source Coding Theorem, coding, prefix codes, lossless channels and their capacity, and Shannon’s Noisy Coding Theorem. Applications to various areas are also featured in the course. (Same as MATH 3280.)
MATH 3050 or MATH 3090 and familiarity with discrete probability or permission of instructor.
This is a project-oriented course on fundamentals of software development and software engineering. Working in teams, students apply a recognized software engineering methodology, a modern programming language and software development tools (including an IDE, debugger, version control system, and testing framework) to design and implement a semester-long project – a software solution for a real-world problem.
The high goal of the course is to train students to function efficiently in a real-world software development environment. To help reach that goal, the students of the course do a lot of independent learning, teamwork, documentation and public presentation of their product and design process.
The particular technologies employed in the course may change in synchrony with changes in software engineering field, currently the focus is on engineering software-as-a-service using Ruby for programming language and Rails for web development framework.
CMPS 1600, CMPS 2200, or approval of the instructor
This course is an introduction to logic and its applications in computer science. The topics covered include soundness and completeness of propositional logic, predicate logic, linear time temporal logic and branching time temporal logics and their expressive power, frameworks for software verification, Hoare triples, partial and total correctness, modal logics and agents, and binary decision diagrams.
CMPS 2200 or equivalent and CMPS 2170 or equivalent, or permission of instructor.
A comprehensive introduction to the mathematics and algorithms that drive today's digital special effects, animation, and games. Designed as a hands-on course, students will gain experience in building 2D/3D interactive applications using OpenGL. Topics covered will include geometric transformations, projections, raster algorithms, 3D object models (surface and volume), visible surface algorithms, texture mapping, lighting/shading, ray-tracing, anti-aliasing, and compositing.
CMPS 1600. Prerequisite can be waived with permission of instructor.
School of Science and Engineering, 201 Lindy Boggs Center, New Orleans, LA 70118 504-865-5764 email@example.com