|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
3, 3/0 Prerequisite: MAT 270. Automata, modules, group codes, linear machines, polynomial rings, cyclic codes, minimum polynomials, context-free grammars, tree automata, polish notation, pushdown automata.
-
3.00 Credits
3, 3/0 Prerequisite: MAT 263 or permission of instructor. Preliminary ideas on order, degree, and solutions; formation of differential equations; differential equations of first-order linear equations with constant coefficients; special high-order equations; simultaneous equations; linear equations of the second order; series solutions.
-
3.00 Credits
3, 3/0 Prerequisite: MAT 315. Laplace transform; inverse Laplace transform and applications; partial differential equations; Fourier series; boundary value problems; transform methods application.
-
3.00 Credits
3, 3/0 Prerequisite: MAT 270. Euclidean constructions; theorems of Menelaus and Ceva; cross-ratio; harmonic points; orthogonal circles; isometrics and similarities in the plane; introduction of projective geometry.
-
3.00 Credits
3, 3/0 Prerequisites: MAT 162, MAT 163, MAT 164, MAT 270, and 0721 major; or permission of instructor. Probability (graphic representations, descriptions of probabilistic events, combinatorics and combinatorial probability); discrete and continuous probability distributions; descriptive statistics; estimation and tests of hypotheses concerning means, proportions, variance and standard deviation and differences between means and proportions.
-
3.00 Credits
3, 3/0 Prerequisite: Four years of Regents high school mathematics. Divisibility; Euclid's algorithm; numbers; prime factorization theorem; Euler's phi-function; Diophantine analysis; congruence; theorems of Fermat, Euler, and Wilson.
-
3.00 Credits
3, 3/0 Prerequisites: MAT 164, MAT 241, and MAT 270; or permission of instructor. Structured programming, verification of program validity, data structures, combinatorial problems, flow network, algorithms, random number generators, simulation of random and nonrandom processes.
-
3.00 Credits
3, 3/0 Prerequisites: MAT 202 and MAT 270. Introduction to network and graph theoretic concepts. Properties with application in computational mathematics, social science, decision making, and physical science.
-
3.00 Credits
3, 3/0 Prerequisites: MAT 270 and either MAT 127 or MAT 162. Probability models; discrete and continuous random variables and their distributions or densities; multivariate distributions; mathematical expectation; special distributions and densities.
-
3.00 Credits
3, 3/0 Prerequisites: MAT 263 and MAT 381. Sampling distributions; central-limit theorem; point and interval estimation; tests of hypotheses.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|