[PORTALNAME]
Toggle menu
Home
Search
Search
Search Transfer Schools
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
PA Bureau of CTE SOAR Programs
Transfer Student Center
Transfer Student Center
Adult Learners
Community College Students
High School Students
Traditional University Students
International Students
Military Learners and Veterans
About
About
Institutional information
Transfer FAQ
Register
Login
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
CMSC 37110: Discrete Mathematics
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course emphasizes mathematical discovery and rigorous proof, illustrated on a variety of accessible and useful topics, including basic number theory, asymptotic growth of sequences, combinatorics and graph theory, discrete probability, and finite Markov chains. The course includes aan introduction to linear algebra. L. Babai. Autumn.
Share
CMSC 37110 - Discrete Mathematics
Favorite
CMSC 37200: Combinatorics
3.00 Credits
University of Chicago
PQ: Linear algebra, basic combinatorics, or consent of instructor. Methods of enumeration, construction, and proof of existence of discrete structures are discussed. The course emphasizes applications of linear algebra, number theory, and the probabilistic method to combinatorics. Applications to the theory of computing are indicated, and open problems are discussed. This course is offered in alternate years. L. Babai. Spring.
Share
CMSC 37200 - Combinatorics
Favorite
CMSC 37400: Constructive Combinatorics
3.00 Credits
University of Chicago
PQ: Advanced knowledge of mathematics and consent of instructor. This course covers constructive combinatorial techniques in areas such as enumerative combinatorics, invariant theory, and representation theory of symmetric groups. Constructive techniques refer to techniques that have algorithmic flavor, such as those that are against purely existential techniques based on counting. K. Mulmuley. Spring. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 37400 - Constructive Combinatorics
Favorite
CMSC 37600: Computational Biology
3.00 Credits
University of Chicago
N. Hinrichs. Spring. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 37600 - Computational Biology
Favorite
CMSC 37701: Topics in Bioinformatics
3.00 Credits
University of Chicago
PQ: Consent of instructor. Current topics in bioinformatics are covered in this course. Autumn, Winter, Spring.
Share
CMSC 37701 - Topics in Bioinformatics
Favorite
CMSC 37720: Computational Systems Biology
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course introduces concepts of systems biology. We also discuss computational methods for analysis, reconstruction, visualization, modeling, and simulation of complex cellular networks (e.g., biochemical pathways for metabolism, regulation, and signaling). Students explore systems of their own choosing and participate in developing algorithms and tools for comparative genomic analysis, metabolic pathway construction, stoichiometeric analysis, flux analysis, metabolic modeling, and cell simulation. We also focus on understanding the computer science challenges in the engineering of prokaryotic organisms. R. Stevens. Autumn. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 37720 - Computational Systems Biology
Favorite
CMSC 37800: Numerical Computation
3.00 Credits
University of Chicago
PQ: STAT 34300 or consent of instructor. This course covers topics in numerical methods and computation that are useful in statistical research (e.g., simulation, random number generation, Monte Carlo methods, quadrature, optimization, matrix methods). Autumn.
Share
CMSC 37800 - Numerical Computation
Favorite
CMSC 38000-38100: Computability Theory I,II
3.00 Credits
University of Chicago
PQ: MATH 25500 or consent of instructor. CMSC 38000 is concerned with recursive (computable) functions and sets generated by an algorithm (recursively enumerable sets). Topics include various mathematical models for computations (e.g., Turing machines and Kleene schemata, enumeration and s-m-n theorems, the recursion theorem, classification of unsolvable problems, priority methods for the construction of recursively enumerable sets and degrees). CMSC 38100 treats classification of sets by the degree of information they encode, algebraic structure and degrees of recursively enumerable sets, advanced priority methods, and generalized recursion theory. This course is taught in alternate years. R. Soare. Winter, Spring.
Share
CMSC 38000-38100 - Computability Theory I,II
Favorite
CMSC 38300: Numerical Solutions to Partial Differential Equations
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course covers the basic mathematical theory behind numerical solution of partial differential equations. We investigate the convergence properties of finite element, finite difference and other discretization methods for solving partial differential equations, introducing Sobolev spaces and polynomial approximation theory. We emphasize error estimators, adaptivity, and optimal-order solvers for linear systems arising from PDEs. Special topics include PDEs of fluid mechanics, max-norm error estimates, and Bananch-space operator-interpolation techniques. T. Dupont. Spring.
Share
CMSC 38300 - Numerical Solutions to Partial Differential Equations
Favorite
CMSC 38500: Computability and Complexity Theory
3.00 Credits
University of Chicago
PQ: Consent of instructor. Part one consists of models for defining computable functions: primitive recursive functions, (general) recursive functions, and Turing machines; the Church-Turing Thesis; unsolvable problems; diagonalization; and properties of computably enumerable sets. Part two deals with Kolmogorov (resource bounded) complexity: the quantity of information in individual objects. Part three covers functions computable with time and space bounds of the Turing machine: polynomial time computability, the classes P and NP, NP-complete problems, polynomial time hierarchy, and P-space complete problems. A. Razborov. Winter.
Share
CMSC 38500 - Computability and Complexity Theory
Favorite
First
Previous
51
52
53
54
55
Next
Last
Results Per Page:
10
20
30
40
50
Search Again
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
College:
(Type the name of a College, University, Exam, or Corporation)
Course Subject:
(For example: Accounting, Psychology)
Course Prefix and Number:
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
Course Title:
(For example: Introduction To Accounting)
Course Description:
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
Within
5 miles
10 miles
25 miles
50 miles
100 miles
200 miles
of
Zip Code
Please enter a valid 5 or 9-digit Zip Code.
(For example: Find all institutions within 5 miles of the selected Zip Code)
State/Region:
Alabama
Alaska
American Samoa
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Federated States of Micronesia
Florida
Georgia
Guam
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Marshall Islands
Maryland
Massachusetts
Michigan
Minnesota
Minor Outlying Islands
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Northern Mariana Islands
Ohio
Oklahoma
Oregon
Palau
Pennsylvania
Puerto Rico
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virgin Islands
Virginia
Washington
West Virginia
Wisconsin
Wyoming
American Samoa
Guam
Northern Marianas Islands
Puerto Rico
Virgin Islands