100 courses with the subject MATH, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
Problem solving, real numbers, algebraic expressions, linear equations, systems of linear equations, proportions, geometry, graphs of linear functions, mathematics of finance.
The second part of a basic mathematics sequence. Sets, logic, probability and statistics. Prerequisite: MATH 112.
Functions and their graphs, transformation of functions, polynomial, rational, exponential and logarithmic functions, systems of equations; applications of these algebraic concepts to other disciplines.
Trigonometric functions and their graphs, Trigonometric identities, inverse trigonometric functions, analytic trigonometry, and applications of trigonometry.
Systems of linear equations and inequalities, introduction to matrices and linear programming, mathematics of finance, sets, counting and probability.
ONLY for students seeking certification to reach PreK - 3/PreK - 6 Number systems and operations, elementary number theory, concepts of integers and rational number, proportions, computational algorithims, current techniques in a problem-solving environment. Including student investigations and hands-on activities.
ONLY for students seeking certification to teach PreK - 3/PreK - 6 Basic algebraic operations, linear and quadratic equations, linear systems of equations and inequalities, algebraic functions in the context of modeling and various representations of functions (graphical, tabular, and symbolic). Will include student investigations and hands-on activities. Prerequisites: MATH 130.
Functions, Polynomial and rational functions, Inverse functions, exponential logarithmic functions, trigonometric functions and their inverses, transformations, polynomial division, roots of polynomials, partial fraction decomposition. Students successfully completing this course cannot take MATH 120 or MATH 121 for credit.
Limits, continuity, derivatives and its applications in business, introduction to integrations. This course cannot be taken as a Mathematics elective by Mathematics majors. Prerequisites: MATH 120.
A basic study of properties and relationships of polygons and polyhedral, transformation geometry, coordinate geometry, construction, deductive and inductive reasoning, the processes of measurement through geometric investigations, and an introduction to non-Euclidean geometries. This course does not satisfy the requirements of MATH 340. ONLY for students seeking certification to reach PreK - 3/PreK - 6 Prerequisites: MATH 131.
Analytic geometry, limits, continuity, derivatives and its applications, introduction to integrations. Prerequisite: MATH 150 or MATH 121.
Techniques and applications of integrations, improper integrals, sequences and series, differentiation and integration of power series, Prerequisites: MATH 260.
Fundamental techniques in discrete mathematics for application in computer science. Sets, mathematical logic, proof techniques, relations, functions, mathematical induction, counting principle, and analysis of algorithms. Prerequisites: MATH 150.
Logical statements, truth tables and logical equivalences, Boolean algebra, predicates and quantifies, proof techniques such as direct proof, by cases, by contraposition, and by contradiction, mathematical induction and recursion, proofs with sets and an introduction to counting. Prerequisite: MATH 150.
Duality, mathematical induction and contradiction, recurrence relations, posets and sorting, vectors and matrices, planar and non-planar graphs, networks, error propagation, combinatorics, circuits, lattices, algebraic systems and machines, algorithms for flowcharting and programming. Prerequisite: MATH 284 Discrete Mathematics I or MATH 280 Discrete Mathematics for Computer Scientists.
A study of the development of mathematical concepts and of the great mathematicians who introduced these concepts; development of integral and differential calculus, development of concepts in modern algebra and the use of rigorous set theory as the foundation for analysis, algebra and topology. Prerequisite: MATH 261 Calculus II or concurrent with MATH 261.
Divisibility theory and prime numbers, Euclidean algorithm, unique factorization, congruences, linear Diophantine equations, and quadratic reciprocity. Prerequisites: MATH 150.
Interest rates, accumulated and discount function, annuities, forborne and deferred, perpetuities, amortization. Prerequisite: MATH 261.
Financial markets and derivatives, hedging and arbitrage pricing. Binomial model. Introduction to stochastic processes and their calculus. The Black-Scholes equations and solutions. Models with continuous dividends. Prerequisite(s): MATH 294, STAT 330 or STAT 340.
The internship allows students to obtain practical work experience related to mathematics under closely supervised conditions for approximately 45 clock hours. Students must complete a Memorandum of Agreement prior to commencing the internship. Course may be taken more than once for credit but no more than 3 times. Prerequisite: Junior standing and permission of department.
A seminar-based approach which examines areas including the appropriate uses of technology, cooperative learning projects, problem-solving, and mathematics content on the state mandated licensing examination for secondary mathematics. Mathematical topics will include algebra and number theory, measurement, trigonometry, functions, and calculus and basic probability theory. Prerequisite: MATH 261.
Review of proof techniques and sets, functions and relations, posets, equivalence relations, quotient sets, cardinal numbers, recurrence relations, and introduction to graph theory. Prerequisite: MATH 280 or MATH 284.
Conditional probability and conditional expectations, continuous and discrete time stochastic processes including random walks. Markov chains, Poissons process, Brownian motion, and Gaussian processes. Prerequisites: MATH 360, STAT 330 or STAT 340.
Techniques for counting and enumeration including recurrence relations, binominal coefficients, the principle of inclusion and exclusion, graph theory, and networks. Prerequisites: MATH 280 or MATH 284.
Systems of linear equations, matrices, determinants, vector spaces, bases, dimensions, linear independence, eigenvalues and eigenvectors, and linear transformations. Prerequisite: MATH 260.
Formulation and analysis of mathematical models with applications to Biology, Finance, Engineering and other areas of science. Prerequisite: MATH 261.
A study of the foundations of Euclidean geometry including transformations deductive and inductive reasoning and an introduction to non-Euclidean geometries. Prerequisite: MATH 260.
Euclidean geometry, logic and incidence geometry, Hilbert’s axioms, projective geometry, neutral geometry, parallel postulate - history and independence, Non-Euclidean geometry, geometric transformations, hyperbolic geometry and philosophical implications. Prerequisite: MATH 340.
Introduction to game theory, the study of strategic behavior among parties having opposed, mixed or similar interests. Topics include social choice functions, May’s Theorem, Pareto and Condorcet criteria, Arrow’s Impossibility Theorem, zero-sum games, best responses and saddle points, mixed strategies, neutralizing strategies, bi-matrix games, solving 2-by-2 bi-matrix games, Nash equilibria, and the Prisoner’s Dilemma. Prerequisite: MATH 325.
Introduction to differential equations, initial value problems, modeling and solutions of first-order differential equations, solutions of higher-order differential equations, boundary value problems, series solutions, Laplace transform. Prerequisite: MATH 261.
This course is designed to develop mathematical models in biology and study the behavior of such models using numerical techniques and review the mathematical concepts behind many important biological principles. Topics will be drawn from conversation biology, genetics, and physiology. Mathematics and computational methods to be reviewed include functions in biology, difference and differential equations, integration as needed, probability, numerical matrix algebra and curve fitting software. Students can receive credit either for MATH 352 or BIOL 352 but not for both. Prerequisites: MATH 260 Calculus I, BIOL 120 Principles of Biology I and BIOL 121 Principles of Biology II, or consent of instructor.
Existence and uniqueness for solutions of ordinary differential equations and difference equations, linear systems, nonlinear systems, stability, periodic solutions, bifurcation theory. Prerequisite: MATH 350.
Polar coordinates, parametric equations, calculus of vector-valued functions, partial derivatives, multiple integrals, line and surface integrals, Lagrange multipliers, Curl and divergence, Green's and Stokes' Theorems. Applications. Prerequisite: MATH 261.
Application of the fundamental probability tools to problems encountered in actuarial science. Risk management and insurance, corporate finance, price theory, actuarial models, loss models, simulation and survival models. Course serves as the capstone course in the Actuarial Science track. Co-requisite: MATH 295.
Introduction to operation research, modeling with linear programming, the simplex method and sensitivity analysis, duality, degeneracy, and applications. Prerequisite: MATH 260.
A capstone course designed to examine the appropriate uses of technology, cooperative learning projects, problem-solving, mathematics content on the state mandated licensing examination for Secondary Mathematics, and presentations by experienced mathematics educators and business leaders. Mathematical topics include data analysis, probability, matrix algebra and discrete mathematics. Students must register and take the state mandated licensing examination for secondary mathematics as a requirement of the course. (May not be used as a mathematics elective). Prerequisite: Admitted to Teacher Education Candidacy and MATH 299, STAT 330 or STAT 340.
The internship allows students to obtain practical work experience related to mathematics under closely supervised conditions for approximately 135 clock hours. Students must complete a Memorandum of Agreement prior to commencing the internship. Course may be taken more than once for credit but no more than two times. Prerequisite: Junior standing and permission of department.
Reinforcing proofs with sets and functions, cardinality of sets, axiom of completeness, basic topology of real numbers, sequences, subsequences and limit theorems, properties of continuous functions, differentiation. Prerequisite: MATH 300 Foundations of Mathematics.
Differentiability, Riemann integrals, Riemann-Stieljes, improper integrals, fundamental theorem of calculus, sequence and series of functions, convergence of series, uniform convergence, power series of functions. Prerequisite: MATH 400.
Matrix algebra, matrix factorization, vector and matrix norms, condition numbers, singular values, diagonalization and similar matrices, Jordan canonical form. Unitary and orthogonal transformations, and the eigenvalue problems. Prerequisite: MATH 325.
Numerical methods for solution of linear systems, perturbation theory and linear least square problem, QR factorization, conditioning and stability of linear systems, iterative methods for linear systems, symmetric eigenvalue problems and singular value decomposition, non-symmetric eigenvalue problems. Prerequisite: MATH 325.
Groups, subgroups, cyclic groups, groups of symmetries, permutation groups, alternating group, cosets, normal subgroups, Lagrange’s theorem, quotient groups, direct product of groups, group homeomorphisms and isomorphism. Prerequisite: MATH 300.
Rings, ring homeomorphisms, subrings, ideals, quotient rings, integral domains, polynomial extensions of rings, fields and field extensions. Prerequisite: MATH 425.
Best approximation in normal spaces, approximation by algebraic polynomials and Weierstrass theorem, trigonometric polynomials, uniform approximation by trigonometric polynomials, Chebyshev polynomials, characterization of the best approximation, and orthogonal polynomials. Prerequisite: MATH 400.
Optimization fundamentals, unconstrained and constrained optimization. Lagrange multipliers, nonlinear programming algorithms and convex optimization. Prerequisite: MATH 360.
Brief introduction of complex numbers and its properties, Elementary functions of Complex variable, Analytic functions and its basic properties, Contour integration, Cauchy’s Theorem and Integral formula, Maximum modulus principles, Series representation of analytic functions, Taylor's Theorem, Classification of singularities, Laurent series, Calculation of residues. Prerequisite: MATH 360, MATH 400.
Metric spaces, topological spaces, separation of axioms, connectedness, compactness, homeomorphisms and product spaces. Prerequisite: MATH 400.
Error analysis, iterative methods for solving equations in one variable including bisection, fixed-point, Newton's and secant iterations, interpolation and polynomial approximation, numerical differentiation and integration, solutions of differential equations. Prerequisite: MATH 350.
An introduction to the chronological history of mathematics and the mathematics who made significant contributions from ancient to modern time. Emphases will be given to development of mathematics from the 19th century BC to the 20th century AD. Prerequisite: MATH 300.
Introduction to digital images, complex numbers and Fourier series, convolution and filters, the Haar wavelet transformation, Daubechies wavelet transformations, wavelet shrinkage.
Dynamics of first-order differences equations, equilibrium points and their stability, periodic points, cycles and their stability, difference equations associated to differential equations, Euler’s method, differences calculus, linear differences equations, first and higher order, homogeneous with constant coefficients, non-homogeneous by the methods of undetermined coefficients, limiting behavior of solutions, nonlinear equations transformable to linear difference equations. Prerequisites: MATH 350.
Basic definitions of graphs, Eulerian and Hamiltonian graphs, graph decompositions, matchings, trees, bipartite graphs, vertex colorings, network algorithms planar graphs, Kuratowski's theorem and the Four-color Theorem. Prerequisites: MATH 284 or MATH 280.
Topics in mathematics not covered in ordinary courses. The course may be repeated once for credit if content is different. Prerequisite: Consent of instructor.
Required of all senior mathematics majors. A capstone course designed to improve students’ research skills, students will work on a research project chosen by the faculty in consultation with the students, write a paper and make a presentation at the end of the semester. Prerequisite: Senior academic standing.
Whole numbers, fractions, decimals, percent’s, signed numbers, averages and medians, powers, exponents and roots, algebraic expressions, equations, verbal problems, counting problems, ratio and proportions, sequence and progressions, inequalities, lines, polygons, tri-angles, quadrilaterals, circles, area and perimeter, coordinate geometry, tables, circle, line and bar graphs, cumulative graphs, analytical reasoning tactics, and logical reasoning tactics. A considerable part of the course will be devoted to practice tests similar to quantitative tests of GRE in order to develop the problem-solving and test-taking techniques required.
Points and lines connected with a triangle; circle properties; collinearity and concurrence; Menelaus’ Theorem; Cevas’ Theorem; Pappus' Theorem; Desargues Theorem; transformations; introduction to inversive and projective geometry. Prerequisite: Admission to the program.
This course examines number systems and operations, elementary number theory, concepts of integers and whole numbers including selected number sets, basic counting principles, and computational algorithms in a problem-solving environment. Appropriate use of technology and manipulatives, NCTM-aligned teaching methodology, and multiple means of authentic assessment will be incorporated into this course that emphasizes the equity principle, and the connections and representations standards. Content delivery will include student investigations and hands-on activities.
This course examines properties and relationships of polygons, transformational geometry, coordinate geometry, constructions, deductive & inductive reasoning, the process of measurement through geometric investigations, and an introduction to matrix Algebra, fractals and non-Euclidean geometries in a problem-solving environment. Appropriate use of technology and manipulatives, NCTM-aligned teaching methodology, and multiple means of authentic assessment will be incorporated into this course that emphasizes the equity principle and the connections and representations standards. Content delivery will include student investigations and hands-on activities.
The course examines structures of familiar number systems to include basic algebraic operations, linear and quadratic equations, linear systems of equations and inequalities, algebraic and trigonometric functions in the context of modeling and various representations of functions (graphical, tabular, and symbolic) in a problem-solving environment. Appropriate use of technology and manipulatives, NCTM-aligned teaching methodology, and multiple means of authentic assessment will be incorporated into this course that emphasizes the equity principle and the connections and representations standards. Content delivery will include student investigations and hands-on activities.
This course examines elementary number theory including divisibility, primes, and composites, concepts of rational numbers, proportions, and computational algorithms in a problem-solving environment. Appropriate use of technology and manipulatives, NCTM-aligned teaching methodology, and multiple means of authentic assessment will be incorporated into this course that emphasizes the equity principle and the connections and representations standards. Content delivery will include student investigations and hands-on activities.
Counting techniques; Pigeon-hole principle; Binominal coefficients; Principle of inclusion-exclusion; generating functions; Stirling and Catalan numbers; permutations and graphs. Prerequisite: Admission to the program.
Linear codes; non-linear codes; B.C.H. codes; dual codes and their weight distributions; perfect codes and cyclic codes; additional topics drawn from Reed-Solomon codes; Justessen codes; M.D.S. codes; Reed-Muller codes; Golay codes; self-dual codes and invariant theory. Prerequisite: MATH 325 or equivalent.
Public key cryptography; classical applications of finite fields and number theory; classical cryptography and cryptoanalysis; monoalpabetic and polyalphabetic ciphers; Shannon’s theory of secrecy; modern private-key cryptosystems such as DES, and public-key cryptosystems such as RSA. (Cross listed as CSCI 580). Prerequisite: MATH 325 or equivalent.
A study of selected topics in mathematics at the graduate level. Content varies by semester and may include topics drawn from areas such as algebra, analysis, geometry, applied mathematics, computer linear algebra, or discrete mathematics. The course is designed to introduce students to advanced material not covered in standard courses or to explore emerging areas of interest. Emphasis is placed on rigorous reasoning, problem solving, and mathematical communication. Prerequisite: Instructor's permission.
Group; subgroups; Lagrange’s Theorem; normal subgroups; quotient groups; homomorphisms; direct products; fundamental Theorem of finite abelian groups; group actions; Cayley’s Theorem; conjugacy classes and the class equation; Sylow Theorems; isomorphism theorems. Prerequisite: MATH 425 or equivalent.
Rings; integral domains; introduction to fields; ring homomorphisms; ideals; polynomial rings; Euclidean domains; unique factorization domains; field Theory; geometric constructions; Galois theory. Prerequisites: MATH 520.
Linear transformations; solving linear equations; LU decomposition; determinants and relation to solving linear equations; eigenvalues and eigenvectors; Jordan canonical form; Schur form; special classes of matrices: normal; symmetric; Hermitian; orthogonal; unitary; Jacobi; Special properties of these matrices; spectral theory for normal matrices; positive matrices; inner product spaces; orthogonality. Prerequisite: MATH 325 or equivalent.
A study of selected advanced topics in algebra beyond the standard sequence in group theory, ring theory, and field theory. Topics may include commutative algebra, homological algebra, representation theory, and algebraic number theory. Emphasis is placed on rigorous theoretical development and proof. Content varies with instructor. Prerequisite: Instructor's permission.
Functions of bounded variation; Lebesgue measure; differentiation and integration; Lp spaces; introduction to Banach and Hilbert spaces. Prerequisite: MATH 401 or equivalent.
Abstract measures; mappings of measure spaces; integration sets and products spaces; the Fubini, Torelli and Radon-Nikodyn theorems; the Riesz-Fischer representation theorem; Haar measures on locally compact groups. Prerequisite: MATH 530.
Linear fractional transformations; conformal mapping; holomorphic functions; Cauchy’s theorem; properties of holomorphic functions; argument principle; residues; power series; Laurent series; meromorphic functions; Riemann mapping theorem; Mittag-Leffler’s theorem; Weierstrass’ theorem. Prerequisite: MATH 432 or equivalent.
Banach spaces; Hilbert spaces; fundamental theorems for Banach and Hilbert spaces; dual spaces; bounded inverse theorems; uniform boundedness principle and its applications; strong and weak convergence; spectral theory of linear operators in normed spaces; compact linear operator on normed spaces and their spectrum. Prerequisite: MATH 530.
A study of selected advanced topics in analysis beyond the standard graduate sequence. Topics may include real analysis, complex analysis, functional analysis, measure theory, or harmonic analysis. Emphasis is placed on rigorous theoretical development and proof. Content varies with instructor. Prerequisite: Instructor's permission.
Approximations and interpolation; propagation of errors; numerical differentiation and integration; solutions of equations; Newton's method; solutions of differential equations and initial value problems; Runge-Kutta and predictor-corrector methods. Prerequisite: MATH 452 or equivalent.
Foundations and fundamental concepts of point-set topology; topological spaces; convergence; connected sets; compactness; product spaces; quotient spaces; function spaces; separation properties; metrization theorems; mappings and compactifications; Homotopy and fundamental groups. Prerequisite: MATH 445 or equivalent.
Topics include difference calculus; linear difference equations; autonomous systems of difference equations; linear periodic systems; stability analysis and Liapunov method; Z-transform; asymptotic behavior of difference equations. Prerequisites: MATH 360 or equivalent; MATH 325 or equivalent.
Existence and uniqueness for systems; linear systems; fundamental matrix solutions; matrix exponential; nonlinear systems; plane autonomous systems and introduction to stability; Poincare-Bendixson theorem. Prerequisite: MATH 350 or equivalent.
A study of selected advanced topics in differential equations beyond the standard graduate sequence. Topics may include ordinary and partial differential equations, dynamical systems, stability theory, or numerical methods. Emphasis is placed on theoretical analysis, qualitative behavior of solutions, and rigorous methods. Content varies with instructor. Prerequisite: Instructor's permission.
Preliminaries from ODE and Calculus; methods of solution of partial differential equations of the first order; classification of partial differential equations; elliptic, hyperbolic, and parabolic equations; Sturm-Liouville problems; non-homogeneous equations; potential theory; techniques of solving various partial differential equations; Cauchy problem; Dirichlet and Neumann problems; Green’s function; Solutions by eigenfunction expansion method; Applications. Prerequisites: MATH 350.
Study of a variety of mathematical and computational methods used to describe and understand natural phenomena and their dynamics in biological systems; topics include difference equations; ordinary and partial differential equations; stochastic processes; and computer simulation with computer algebra systems. Prerequisite: MATH 548 or MATH 546.
A study of selected advanced topics in geometry beyond the standard graduate sequence. Topics may include differential geometry, Riemannian geometry, algebraic geometry, or geometric topology. Emphasis is placed on rigorous theoretical development and proof. Content varies with instructor. Prerequisite: Instructor's permission.
Basic techniques of algorithm design; fundamental computations with polynomials; Fast Fourier transform; polynomial evaluation and interpolation; power series manipulation; fundamental computations with general and special structured matrices and correlation to polynomials; fast algorithms and correlation between algebraic and numerical computations in algorithm design. Prerequisites: MATH 325 and MATH 261.
Univariate and multivariate distribution theory; generating function; inequalities in statistics; order statistics; estimation theory; likelihood; sufficiency; efficiency; maximum likelihood testing hypotheses; likelihood ratio; confidence and prediction interval; Bayesian estimation and testing; basic decision theory. Prerequisite: MATH 261 or equivalent.
A study of selected advanced topics in graph theory at the graduate level. Topics may include graph connectivity, coloring, extremal graph theory, random graphs, algebraic graph theory, or network flows. Emphasis is placed on rigorous theory, proof techniques, and applications. Content varies with instructor. Prerequisite: Instructor's permission.
Arithmetic functions; divisibility and prime factorization; residue classes; congruence; the prime number theorem; primes in arithmetic progression; quadratic reciprocity law; the arithmetic of quadratic fields; Diophantine equations; continued fractions, approximations and sieves. Prerequisite: MATH 425 or equivalent.
A study of selected advanced topics in computational mathematics at the graduate level. Topics may include numerical linear algebra, eigenvalue problems, matrix factorizations, iterative methods for linear systems, numerical solutions of differential equations, optimization methods, conditioning and numerical stability, and applications in scientific computing and computational modeling. Emphasis is placed on the development, analysis, and implementation of numerical algorithms. Content varies with instructor. Prerequisite: Instructor's permission.
Chronological and topical history of mathematics, mathematics education and related areas as they parallel ancient and modern world history and U.S. history. The influence of mathematics as a derivative of philosophy and science. The origins of mathematical symbols and the development of a deductive system used as structures of knowledge in other disciplines. Specific topics include: women in mathematics, blacks in mathematics, multicultural development of mathematics, the development of calculating devices, using math history in multidisciplinary teaching.
Selected topics in geometry for teachers of mathematics. Topics include deductive logic, incidence geometry, abstract deductive systems, induction, convexity and separation, geometric inequalities, congruence, similarity, parallelism, Euclidean and non-Euclidean geometries.
Topics in modern algebra including sets, mappings, equivalence relations, groups, groups homomorphism, isomorphism, rings, integral domains, and fields.
Real number theory; elementary and advanced set theory including open and closed sets, compacts sets and bounded sets; methodology of writing mathematical proofs including mathematical induction and proof of calculus theorems; introduction to sequence and series; convergence tests.
Students will employ various heuristics while engage in problem solving. Student will pose problems appropriate for middle school and high school students. Problem topics will be selected from arithmetic, basic algebra, geometry, trigonometry, analytic geometry, functions and their graphs, calculus, probability and statistics, discrete mathematics and linear algebra. Mathematical reasoning and mathematical modeling will be emphasized. Appropriate use of technology will be discussed, modeled, and used during the problem-solving process.
Inequalities, absolute values, limits and rates of changes, continuity, derivatives, applications of differentiation, integers, applications of integration, inverse functions and techniques of integration. Topics are treated from an advanced point of view for teachers of mathematics.
Integration techniques, polynomial approximation and series, polar coordinates, conics, multivariate calculus, parametric equations, and vectors. Course is designed to make connections between advanced calculus topics and the teaching of AP calculus. Prerequisite: MAED 575.
The terminology, concepts, and techniques of some areas of discrete mathematics applicable to middle and high school teaching. Logic, proof techniques, recursion, set theory and enumeration, relations functions, and introduction code and graph theory. Course is designed to make connections between discrete mathematics topics and the teaching of discrete mathematics in middle and high school.
Vectors, matrix operations, systems of linear equations, determinants, systems of linear inequalities and linear transformations. Topics are treated from an advanced point of view for teachers of mathematics. Use knowledge of mathematics to select and use appropriate technological tools, such as but not limited to, spreadsheets, dynamic graphing tools, computer algebra systems, dynamic statistical packages, graphing calculators, data-collection devices, and presentation software.
Differential manifolds; tensors; affine connections; and Riemannian manifolds; submanifolds; variation of the length integral; the Morse index theorem. Prerequisites: MATH 445, MATH 401, or equivalent.
Basic concepts of graphs and digraphs; Eulerian and Hamiltonian graphs; trees and distances; matchings and factors; connectivity; colorings; planar graphs; flows and networks; extremal graph theory. Prerequisite: MATH 490 or equivalent.
Convexity; duality; quadratic forms and matrix factorization; theory of optimization with and without constraints; Lagrange functions; Kuhn-Tucker theory; methods of optimization without constraints; line search; descent methods; Newton methods; conjugate directions; non-linear least squares; methods of optimization with constraints: linear optimization; the simplex and other methods; active sets; quadratic programming; optimization with linear constraints; general non-linear optimization. Prerequisite: MATH 392 or equivalent.
A zero-credit course designed for candidates eligible for the Master of Science Degree in Mathematics who have selected the non-thesis option track. Students will be able to register for this course and take the comprehensive exam after completing the core courses.
Quick Links Bookstore Career Services Emergency Information Human Resources Library Information Technology Services Submit Web Request Office of Communications C.A.R.E. Team Resources Academic Calendar Careers Research Virginia Cooperative Extension Campus Maps And Directions Personnel Directory Conference Services Health Services Adam Law Reports Stay Connected Social Media Directory RAVE Emergency Alert System VSU Live Events Headlines & Announcements Calendar of Events Virginia State University1 Hayden Dr.Virginia State University, VA 23806804-524-5000 Back to top Close this window Print Options Send Page to Printer Print this page. Download Page (PDF)The PDF will include all information unique to this page.2020-2022 Undergraduate CatalogA PDF of the entire 2020-2022 Undergraduate catalog.2020-2022 Graduate CatalogA PDF of the entire 2020-2022 Graduate Catalog.2025-2026 Academic CatalogA PDF version of the entire 2025-2026 Academic Undergraduate and Graduate Catalog.2026-2027 Graduate Academic CatalogA PDF version of the 2026-2027 Graduate Academic Catalog2026-2027 Undergraduate Academic CatalogA PDF version of the 2026-2027 Undergraduate Academic Catalog
Source: Virginia State University's catalog, linked per course · table learning_unit · CourseShelf publish 59
