Mathematics & Computer Science

Regularly Offered Courses

Math 507, Topics in Combinatorics

The advanced combinatorics course. Topics vary depending on the instructor.

Math 509, Model Theory

A basic graduate course in model theory and the elements of logic.

Math 513, Analysis I

With Math 514, a first-year two-semester graduate sequence in real and complex analysis.

Math 514, Analysis I

The continuation of 513.

Math 515, Analysis II

This is the advanced graduate analysis course. Topics vary depending on the instructor.

Math 516, Analysis II

The spring semester version of 515.

Math 523, Topology I

With Math 524, a first-year two-semester graduate sequence in topology. Topics are selected from: set theory, topological spaces, connectivity, compactness, separation conditions, the Tychonoff theorem, compactifications, metrization theorems, function spaces, completeness, the fundamental group, homotopy theory and covering spaces, homology theory, and applications.

Math 524, Topology I

The continuation of 523.

Math 525, Topology II

The advanced graduate topology course. Topics vary depending on the instructor.

Math 526, Topology II

The spring-semester version of 525.

Math 527, Dynamical Systems

An introduction to dynamical systems including the study of measure preserving transformations, entropy and information, and the iteration of continuous self maps of compact metric spaces.

Math 528, Ergodic Theory

An introduction to ergodic theory that develops the basic properties of measure-preserving automorphisms of probability spaces.

Math 531, Coding Theory

A course in coding theory. Topics vary depending on the instructor.

Math 533, Topological Groups

A survey of the basic definitions and major fundamental results in topological groups.

Math 535, Set Theory

An introduction to the axioms of set theory and constructibility.

Math 543, Algebra I

The first-year graduate algebra course. The basic topics are groups, rings, and fields including the Sylow theorems and Galois theory.

Math 544, Algebra I

The spring-semester version of 543.

Math 545, Algebra II

Advanced graduate algebra. Topics vary depending on the instructor.

Math 546, Algebra II

Same as 545.

Math 572, Special Topics in Mathematics

Supervised reading course of varying length. This course may be repeated for credit.

Comp 500, Automata Theory and Formal Languages

An introduction to formalisms studied in computer science and mathematical models of computing machines. The language formalisms discussed include regular, context-free, context-sensitive, and recursively enumerable languages. The machines discussed include finite-state, pushdown and linear bounded automata and Turing machines. Crosslisted with Comp 301.

Comp 510, Algorithms and Complexity

The course will cover the design and analysis of efficient algorithms. Basic topics will include greedy algorithms, divide-and-conquer algorithms, dynamic programming, and graph algorithms. Some advanced topics in algorithms may be selected from other areas of computer science. Crosslisted with Comp 312.

Comp 521, Design of Programming Languages

An introduction to concepts in programming languages. Topics include parameter passing, type checking and inference, control mechanisms, data abstraction, module systems, and concurrency. Basic ideas in functional, object-oriented and logic programming languages will be discussed. Crosslisted with Comp 321.

Comp 531, Computer Structure and Operation

The purpose of the course is to introduce and discuss the structure and operation of digital computers. Topics will include the logic of circuits, microarchitectures, microprogramming, conventional machine architectures, and an introduction to software/hardware interface issues. Assembly language programming will be used to demonstrate some of the basic concepts. Crosslisted with Comp 231.

Comp 550, Bioinformatics and Functional Genomics

This focused-inquiry course will interweave the discussion of biological and informatic topics focusing on computational issues and tools used in the interdisciplinary fields. Possible topics include the application of alignment algorithms to the analysis of genomic sequences, cluster analysis of micro-arrays of gene expression, and the prediction of RNA secondary structures using dynamic programming methods. Crosslisted with Comp 350.

Comp 552, Foundations Of Computer Science

The spring-semester version of 551.

Comp 554, Principles of Databases

This course provides an introduction to the design and implementation of relational of databases. Topics will include an introduction to relational algebra and SQL, relational database design, database management systems, and transaction processing. Crosslisted with Comp 354.

Comp 571, Special Topics in Computer Science

Supervised reading course of varying length. This course may be repeated for credit.

Comp 572, Special Topics in Computer Science

The spring-semester version of 571.