[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 27400: Honors Combinatorics and Probability
3.00 Credits
University of Chicago
PQ: MATH 25000 or 25400, or CMSC 27100, or consent of instructor. Experience with mathematical proofs. Methods of enumeration, construction, and proof of existence of discrete structures are discussed in conjunction with the basic concepts of probability theory over a finite sample space. Enumeration techniques are applied to the calculation of probabilities, and, conversely, probabilistic arguments are used in the analysis of combinatorial structures. Other topics include basic counting, linear recurrences, generating functions, Latin squares, finite projective planes, graph theory, Ramsey theory, coloring graphs and set systems, random variables, independence, expected value, standard deviation, and Chebyshev's and Chernoff' s inequalities . L. Babai. Spring.
Share
CMSC 27400 - Honors Combinatorics and Probability
Favorite
CMSC 27500: Graph Theory
3.00 Credits
University of Chicago
PQ: CMSC 15300. This course covers the basics of the theory of finite graphs. Topics include shortest paths, spanning trees, counting techniques, matchings, Hamiltonian cycles, chromatic number, extremal graph theory, Turan's theorem, planarity, Menger' s theorem, the max-flow/min-cut theorem, Ramsey theory, directed graphs, strongly connected components, directed acyclic graphs, and tournaments. Techniques studied include the probabilistic method . Spring.
Share
CMSC 27500 - Graph Theory
Favorite
CMSC 27600: Computational Biology
3.00 Credits
University of Chicago
PQ: Familiarity with basic discrete mathematics/statistics/algorithms and biology is helpful but not required. This course serves as a general introduction to the basic algorithms used to understand current problems in biology. Topics may include sequence alignment algorithms to study DNA and protein sequences, algorithms and experiments for protein structure prediction, dynamics, and folding, clustering and machine learning methods for gene expression analysis, computational models of RNA structure, and DNA computing and self-assembly. N. Hinrichs. Spring. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 27600 - Computational Biology
Favorite
CMSC 27700: Mathematical Logic I
3.00 Credits
University of Chicago
PQ: MATH 25400 or 25700. This course introduces mathematical logic. Topics include propositional and predicate logic and the syntactic notion of proof versus the semantic notion of truth (e.g., soundness, completeness). We also discuss the G del completeness theorem, the compactness theorem, and applications of compactness to algebraic problems. Autumn.
Share
CMSC 27700 - Mathematical Logic I
Favorite
CMSC 27800: Mathematical Logic II
3.00 Credits
University of Chicago
PQ: MATH 27700 or equivalent. Topics include number theory, Peano arithmetic, Turing compatibility, unsolvable problems, G del's incompleteness theorem, undecidable theories (e.g., the theory of groups), quantifier elimination, and decidable theories (e.g., the theory of algebraically closed fields). Winter.
Share
CMSC 27800 - Mathematical Logic II
Favorite
CMSC 27900: Chaos,Complexity,and Computers
3.00 Credits
University of Chicago
PQ: One year of calculus, two quarters of physics at any level, and PHYS 25000 or prior programming experience. For course description, see Physics. Winter. L.
Share
CMSC 27900 - Chaos,Complexity,and Computers
Favorite
CMSC 28000: Introduction to Formal Languages
3.00 Credits
University of Chicago
PQ: CMSC 15300, or MATH 25000 or 25500. This course is a basic introduction to computability theory and formal languages. Topics include automata theory, regular languages, context-free languages, and Turing machines. Autumn.
Share
CMSC 28000 - Introduction to Formal Languages
Favorite
CMSC 28100: Introduction to Complexity Theory
3.00 Credits
University of Chicago
PQ: CMSC 27100, or MATH 25000 or 25500; and experience with mathematical proofs. Computability topics are discussed (e.g., the s-m-n theorem and the recursion theorem, resource-bounded computation). This course introduces complexity theory. Relationships between space and time, determinism and non-determinism, NP-completeness, and the P versus NP question are investigated. Spring.
Share
CMSC 28100 - Introduction to Complexity Theory
Favorite
CMSC 28501: Topics in Scientific Computing
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course covers current topics in scientific computing. Autumn, Winter, Spring.
Share
CMSC 28501 - Topics in Scientific Computing
Favorite
CMSC 28510: Introduction to Scientific Computing
3.00 Credits
University of Chicago
PQ: A year of calculus (MATH 15300 or higher), a quarter of linear algebra (MATH 19620 or higher), and CMSC 10600 or higher; or consent of instructor. Basic processes of numerical computation are examined from both an experimental and theoretical point of view. This course deals with numerical linear algebra, approximation of functions, approximate integration and differentiation, Fourier transformation, solution of nonlinear equations, and the approximate solution of initial value problems for ordinary differential equations. We concentrate on a few widely used methods in each area covered. T. Dupont. Autumn. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 28510 - Introduction to Scientific Computing
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