Data Science Track

Explores limits and approximation, differential and integral calculus of the elementary algebraic and transcendental functions, and applications of differentiation and integration.
Prerequisite: Minimum grade of C in MA-140 or placement by Dpt

Covers applications and methods of integration, inverse trigonometric functions, improper integrals, sequences and series, parametric representation, and polar coordinates.
Prerequisite: Take MA-151 with a minimum grade of C, P

LaTeX is the free, open-sourced software that is the industry standard used for typesetting professional documents that involve mathematical notation. This course introduces essential components of a functioning LaTeX file, including document classes, preambles and packages, mathematical symbols, commands, display math, spacing and alignment, arrays, image insertion, and references. Students will be given multiple opportunities to practice typesetting documents using LaTeX. Templates for future use will be supplied and reviewed.  This course is Pass/Fail.
Prerequisite: Take MA-151; min grade of C or permission of dept chair

Introduces three-dimensional analytic geometry, multivariable calculus, realvalued functions of several variables, limits and continuity, partial derivatives, multiple integration, and vector calculus.
Prerequisite: Take MA-152 with a minimum grade of C, P

Focuses on matrix theory, systems of linear equations, linear transformations, vector spaces and subspaces, determinants, eigenvalues, inner product spaces, and orthogonality.
Prerequisite: MA-152 with a minimum grade of C, P

Introduces students to the understanding and creation of rigorous mathematical arguments and proofs. Includes methods of proof, set theory, relations and functions, properties of the integers, real and complex numbers, and polynomials.
Prerequisite: MA-152; MINIMUM GRADE C, P

Addresses probability, discrete random variables and their distributions, mathematical expectations, sampling distributions, and multivariate distributions. Offered every Third Semester.
Prerequisite: Math-152 with a minimum grade of C, P

Addresses statistics with an emphasis on the underlying mathematical theory. Topics include point estimation and its properties, interval estimation, correlation, regression, and hypothesis testing involving parametric as well as non-parametric methods. Offered every Third Semester.
Prerequisite: Take MA-331 with Minimum Grade of C, P

Capstone course for the mathematics major. Each student works on a research project leading to an oral presentation and the writing of a formal paper. Senior standing required.
Prerequisite: Take MA-301C or better

This course covers advanced theories of Euclidean geometry and introduces non-Euclidean geometries such as spherical and hyperbolic.
Prerequisite: Take MA-301 with Minimum Grade of C, P

This course introduces both point-set and algebraic topology. Topics covered include topological spaces, metric spaces, continuity, homeomorphisms, connectedness, compactness, and fundamental groups.
Prerequisite: Minimum grade of C, P in MA-301

Focuses on structures and properties of graphs and their applications. Topics include traversability, trees, connectivity, network flow, graph coloring, chromatic number, and planarity. Discussion of application of graph theory to computer science, transportation, scheduling, communication, chemistry, and a variety of other fields. Writing mathematical proofs will be an essential part of this course.
Prerequisite: Take MA 301 with a grade of C, P or better

This course is designed to give students a basic understanding of the properties of numbers, mainly the integers and rational numbers and their applications. Topics covered include primes and divisibility, congruence modulo n, Euler's phi function, and continued fractions. Applications discussed include check digit schemes and cryptology. Writing mathematical proofs will be an essential part of this course.
Prerequisite: TAKE MA-301 with grade of C or better, P

Explores algebraic systems, group theory, quotient structures, isomorphism theorems, ring theory and ideals, as well as integral domains and fields. Writing mathematical proofs will be an essential part of this course.
Prerequisite: Minimum grade of C, P in MA-261 and MA-301

Addresses real numbers, cardinality, metric spaces, convergence, topology, continuity, differentiability, and Riemann integration. Writing mathematical proofs will be an essential part of this course.
Prerequisite: MA-301 with a minimum grade of C, P

Examines the algebra and geometry of complex numbers, analytic functions, integration, Taylor and Laurent series, contour integration, and conformal mapping.
Prerequisite: Take MA-253 with Minimum Grade of C, P

Focuses on equations involving functions and one or more of its derivatives. Examines first-order differential equations, numerical and qualitative techniques for solving differential equations, linear systems, geometry of linear systems, and applications to forcing/resonance. If time permits, the course will address the Laplace Transform, convolutions, and advanced numerical methods for solving equations. Offered every third Semester.
Prerequisite: Take MA-152 with Minimum Grade of C, P or Transfer

This course introduces students to solving numerical problems approximately using algorithms and understanding the accuracy of the approximations. A high level software package such as Maple/Mathematica/Matlab would play an important role in this course.
Prerequisite: Minimum grade of C, P in MA-152 and MA-261

Mathematical models represent real-world phenomena using mathematical concepts and language. This course uses mathematical models to analyze and explain the behavior of problems from the physical and social sciences.
Prerequisite: Take MA-152 C or better

A first course in programming using a structured programming language. Topics include iteration, selection, procedures, functions, and arrays with the use of flowcharts and modules. Presents applications in both business and scientific areas.

A continuation of CS 111 using a structured programming language to implement multidimensional arrays, stacks, queues, linked lists, and binary trees. Also introduces recursion, pointers, and classes.
Prerequisite: Take CS-111

Explores fundamentals of database design theory and applications. Includes data models with emphasis on the relational model.
Prerequisite: Take CS-112;