Current MSCS Graduate Courses ( Spring 2017, Fall 2017, Spring 2018 )

Spring 2017

MCS 501

Computer Algorithms II (G. 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 (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 573

Topics in Numerical Analysis of Partial Differential Equations (Awanou)
PREREQUISITES:
MATH 481 and MCS 471; and consent of the instructor.
DESCRIPTION:
Topics in numerical analysis of partial differential equations which may include: High-order Finite Element methods, Discontinuous Glerkin methods, Spectral methods, or Integral Equation methods. May be repeated if topics vary.

MCS 591

Advanced Topics in Combinatorial Theory: Enumerative Combinatorics (Mubayi)
PREREQUISITES:
MCS 423
DESCRIPTION:

Fall 2017

MCS 521

Combinatorial Optimization (Friedland)
PREREQUISITES:
MCS 423 and Stat 471.
DESCRIPTION:
Network flows, bipartite matching, Edmonds algorithm for non-bipartite matching, the matching polytope, matroids, greedy algorithm.

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 591

Advanced Topics in Combinatorial Theory: The Probabilistic Method (Mubayi)
PREREQUISITES:
TBD
DESCRIPTION:
TBA

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.
HTML 5 CSS FAE
UIC LAS MSCS > course info > graduate courses