Current MSCS Graduate Courses ( Fall 2009, Spring 2010 )
Fall 2009
MCS 501
Computer Algorithms II
(B. DasGupta)
- 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 507
Mathematical, Statistical and Scientific Software
(R. Grossman)
- PREREQUISITES:
- Grade of B or better in MCS 360 or an equivalent course; or consent of the instructor.
- DESCRIPTION:
- The design, analysis, and use of mathematical, statistical, and scientific software.
MCS 541
Computational Complexity
(G. 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 572
Introduction to Supercomputing
(D. Nicholls)
- 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.
Spring 2010
MCS 504
Mathematics and Information Sciences for Industry Workshop
(R. Grossman)
- PREREQUISITES:
- Grade of B or better in MCS 401, 471, and 507.
- DESCRIPTION:
- A project course on one or more topics in applied mathematics, statistics, or computer science, motivated by industrial problems. The topics vary from year to year.
MCS 521
Combinatorial Optimization
(S. Friedland)
- PREREQUISITES:
- MCS 423 and Stat 471.
- DESCRIPTION:
- Combinatorial optimization; network flows, bipartite matching, Edmonds algorithm for non-bipartite matching, the matching polytope, matroids, greedy algorithm, matroid union and intersection algorithms, matroid polyhedra, polymatroids.
MCS 590
Advanced Topics in Computer Science
(J. Bona)
- PREREQUISITES:
- An undergraduate course in combinatorics or probability and the mathematical maturity of a graduate student.
- DESCRIPTION:
MCS 591
Advanced Topics in Combinatorial Theory
(D. Mubayi)
- PREREQUISITES:
- Ideal preparation is MCS 423 or a standard undergraduate course in graph theory, but almost all topics will be developed from scratch, and the only real prerequisite is "mathematical maturity".
- DESCRIPTION:
- This course will cover the major results in graph theory. It is intended as a serious graduate course for students in mathematics, computer science, and engineering. Proposed topics include matchings, connectivity, planarity, coloring, flows, extremal problems, Ramsey theory, cycles, minors, and the basics of random graphs if time permits. We will attempt to cover all but the last chapter of the book Graph Theory by Diestel, roughly at the pace of one chapter per week, except for some longer chapters that will take two weeks.