|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Prerequisite: MATH 2083 and MATH 3000 Elementary properties of integers, groups, rings, and fields; mappings, homomorphisms, kernels, quotient structures.
-
3.00 Credits
Prerequisite: MATH 2160 and MATH 3000 Abstract vector spaces, linear transformations, eigenvectors and eigenvalues, diagonalization, inner product spaces, real quadratic forms.
-
3.00 Credits
Prerequisite: MATH 2200 and either ITEC 1050 or CSCI 1060 Data analyses including topics from elementary statistics as well as ANOVA, multiple regression and nonparametric statistics using statistical software packages such as Minitab, SAS, or SPSS.
-
3.00 Credits
Prerequisite: MATH 3000 Counting principles such as permutations, combinations, derangements, pigeonhole, and inclusion/ exclusion; partitions; generating functions; recurrence relations; applications from graph theory and applied algebra.
-
3.00 Credits
Prerequisite: MATH 3000 An axiomatic approach to the fundamental ideas of Euclidean geometry, including congruence, similarities, circles, elementary transformations and constructions. Examination of non-Euclidean geometries.
-
3.00 Credits
First order linear and nonlinear equations; second and higher order linear equations; applications; the Laplace transform; numerical solution with emphasis on computer-aided solution.
-
3.00 Credits
Series solutions; linear and non-linear first order systems; applications; numerical methods; boundary value problems; introduction to Fourier series and partial differential equations.
-
3.00 Credits
Prerequisite: MATH 2160 and either STAT 3211 or STAT 3231 or permission of instructor Linear programming topics including simplex algorithm, sensitivity analysis, duality, modeling; Additional topics from project management, decision analysis, queueing theory, simulation, dynamic programming, game theory.
-
3.00 Credits
Prerequisite: MATH 2160 Network analysis topics including shortest path, maximum flow, min-cut/max-flow theorem, minimum cost networks, minimum spanning trees, matching and coloring problems; Additional topics from operations research including nonlinear, integer programming.
-
3.00 Credits
No course description available.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|