### Current MSCS Graduate Courses ( Spring 2018, Fall 2018, Spring 2019 )

### Spring 2018

#### MCS 501

Computer Algorithms II (Turan)- PREREQUISITES:
- MCS 401.
- DESCRIPTION:
- Continuation of MCS 401. Advanced topics in algorithms, lower bounds, union-find problems, fast Fourier transform, complexity of arithmetic, polynomial and matrix calculations, approximation algorithms, parallel algorithms.

#### MCS 541

Computational Complexity (Turan)- PREREQUISITES:
- Consent of the instructor.
- DESCRIPTION:
- Time and space complexity of computations, classification of math problems according to their computational complexity, P not equal NP problem.

#### MCS 571

Numerical Methods for Partial Differential Equations (Awanou)- PREREQUISITES:
- Math 481 and MCS 471 or consent of instructor.
- DESCRIPTION:
- Finite difference methods for parabolic, elliptic and hyperbolic differential equations: explicit, Crank-Nicolson implicit, alternating directions implicit, Jacobi, Gauss-Seidel, successive over-relaxation, conjugate gradient, Lax-Wendroff, Fourier stability.

### Fall 2018

#### MCS 548

Mathematical Theory of Artificial Intelligence (Reyzin)- PREREQUISITES:
- MCS 541.
- DESCRIPTION:
- Valiant's learning model, positive and negative results in learnability, automation inference, perceptrons, Rosenblatt's theorem, convergence theorem, threshold circuits, inductive inference of programs, grammars and automata.

#### MCS 563

Analytic Symbolic Computation (Verschelde)- PREREQUISITES:
- Grade of C or better in MCS 460 or the equivalent, and MATH 480 or consent of the instructor.
- DESCRIPTION:
- Analytic computation, including integration algorithms, differential equations, perturbation theory, mixed symbolic-numeric algorithms, and other related topics.

#### MCS 591

Advanced Topics in Combinatorial Theory: Extremal Combinatorics (Mubayi)- PREREQUISITES:
- An undergraduate course in combinatorics/graph theory or probability, and the mathematical maturity of a (relatively advanced) graduate student.
- DESCRIPTION:
- Extremal combinatorics studies the extreme value of a parameter over a class of discrete objects. The subject has been growing for the past century and by now it encompasses some of the most important contributions to combinatorics and has applications to many other disciplines including discrete geometry, number theory, coding theory, computer science. This course will study the modern developments in the subject focusing on graph and hypergraph theory. Throughout the course open problems will be presented that are suitable for thesis research

### Spring 2019

#### MCS 501

Computer Algorithms II (Turan)- PREREQUISITES:
- MCS 401.
- DESCRIPTION:
- Continuation of MCS 401. Advanced topics in algorithms, lower bounds, union-find problems, fast Fourier transform, complexity of arithmetic, polynomial and matrix calculations, approximation algorithms, parallel algorithms.

#### MCS 571

Numerical Methods for Partial Differential Equations (Nicholls)- PREREQUISITES:
- Math 481 and MCS 471 or consent of instructor.
- DESCRIPTION:
- Finite difference methods for parabolic, elliptic and hyperbolic differential equations: explicit, Crank-Nicolson implicit, alternating directions implicit, Jacobi, Gauss-Seidel, successive over-relaxation, conjugate gradient, Lax-Wendroff, Fourier stability.

#### MCS 572

Introduction to Supercomputing (Awanou)- PREREQUISITES:
- MCS 471 or 571 or consent of instructor.
- DESCRIPTION:
- Introduction to supercomputing on vector and parallel processors; architectural comparisons, parallel algorithms, vectorization techniques, parallelization techniques, actual implementation on real machines.

#### MCS 590

Advanced Topics in Computer Science: Turan (Turan)- PREREQUISITES:
- TBD
- DESCRIPTION:
- TBD