MTH 099: Intermediate Algebra
MTH 101: Algebra for College Students
MTH 103: Finite Mathematics
MTH 105: Algebra and Trgonometry
MTH 107: Precalculus Mathematics I
MTH 108: Precalculus Mathematics II
MTH 109: Introductory Calculus
MTH 110: Analytic Geometry and Calculus I
MTH 111: Calculus I
MTH 112: Calculus II
MTH 119: Computers and the Internet
MTH 120: Computer Programming I
MTH 131: Calculus I
MTH 132: Calculus II
MTH 210: Vectors and Matrices
MTH 211: Calculus III
MTH 220: Programming II
MTH 224: Introduction to Probability and Statistics
MTH 228: Assembly Language Programming
MTH 230: Introduction to Abstract Mathematics
MTH 309: Discrete Mathematics I
MTH 310: Multivariable Calculus
MTH 311: Ordinary Differential Equations
MTH 312: Vector Analysis
MTH 317: Introduction to Data Structures
MTH 320: Introduction to Numerical Analysis
MTH 322: C Programming and UNIX
MTH 471, 472: Directed Readings
MTH 504: Foundations of Geometry
MTH 506: Logic
MTH 508: Survey of Modern Algebra
MTH 509: Discrete Mathematics II
MTH 512: Elementary Complex Analysis
MTH 513: Partial Differential Equations I
MTH 514: Partial Differential Equations II
MTH 515: Ordinary Differential Equations
MTH 516: Dynamics and Bifurcations
MTH 517: Data Structures and Algorithm Analysis
MTH 518: Interpreters and Compiler Theory
MTH 519: Programming Languages
MTH 520: Numerical Analysis I
MTH 521: Numerical Analysis II
MTH 523: Principles of Filing and Database Systems
MTH 524: Introduction to Probability Theory
MTH 525: Introduction to Mathematical Statistics
MTH 527: Theory of Automata
MTH 528: Combinatorics
MTH 529: Introduction to Computer Graphics
MTH 531, 532: Topology
MTH 533: Introduction to Real Analysis I
MTH 534: Introduction to Real Analysis II
MTH 540: Algorithm Design and Analysis
MTH 545: Introduction to Artificial Intelligence
MTH 561: Abstract Algebra
MTH 562: Abstract Algebra
MTH 596: Operating Systems and Networking
Last modified: Fri Jun 6 16:11:40 EDT 1997
Introductory Courses
Real number operations, polynomials, factoring,
rational numbers and rational expressions.
Prerequisite: Extreme deficiency in algebra.
Cannot be used to fulfill the 120 credits required
for graduation.
Credits: 3.
Algebraic operations and properties of the real numbers;
linear and quadratic equations and inequalities;
polynomials and factoring; rational expressions;
radical expressions; graphs of lines; systems of linear
equations.
Prerequisite: Adequate achievement on Mathematics
Placement Test. Not open to students with credit in
MTH 105 or 107. Not for major or minor.
Credits: 3.
Statements, sets, partitions of sets, permutations,
combinations probability, relations and functions,
introduction to linear programming, matrices.
Prerequisite: MTH 101 or adequate achievement
on Mathematics Placement Test. Not for major or minor.
Credits: 3.
An intensive course in algebra and trigonometry as covered
in MTH 107-108, but without analytic geometry.
Prerequisite: MTH 101 or adequate achievement
on Mathematics Placement Test. Not open to students with credit in
MTH 107 or 108.
Not for major or minor.
Credits: 5.
Alegebraic operations; equations and inequalities; complex
numbers; functions and their graphs; polynomial, exponential,
and logarithmic functions; systems of equations.
Prerequisite: Adequate achievement
on Mathematics Placement Test. Not open to students with credit in
MTH 105.
Not for major or minor.
Credits: 3.
Rational functions; analytic geometyr; trigonometric fuctions,
identities, and equations.
Prerequisite: MTH 107 or adequate achievement
on Mathematics Placement Test. Not open to students with credit in
MTH 105.
Not for major or minor.
Credits: 3.
A one semester survey of the fundamental principles of calculus;
functions, limits, derivatives, definite integrals, applications.
Prerequisite: MTH 107 or adequate achievement
on Mathematics Placement Test.
Not for major or minor.
Not for B.S. students.
Credits: 3.
Introduction to plane analytic geometry,
and the subject matter of MTH111.
Prerequisite: MTH 105 or adequate achievement
on Mathematics Placement Test and high school trigonometry.
Not open to students with credit in MTH 111 or 131.
Credits: 5.
Limits and continuity, derivatives and applications,
the definite integral and applications.
Prerequisite: MTH 108 or adequate achievement
on Mathematics Placement Test together with completion of
high school trigonometry and analytic geometry.
Not open to students with credit in MTH 110 or 131.
Credits: 4.
Transcendental functions, methods of integration, L'Hôpital's
Rule and improper integrals, infinite series, polar
coordinates, and introduction to differential equations.
Prerequisite: MTH 110 or 111.
Not open to students with credit in MTH 132.
Credits: 4.
See description on the Math 119
Home Page
Credits: 3.
Introduction to programming with emphasis on style and algorithm
development. Data types, I/O, conditionals, loops, functions, arrays,
structures, modular programming design, basic software development
tools. Recursion, iteration, control constructs, scoping and lifetime
of variables, call mechanisms, methods of code development: loop
invariants, data structure invariants. Intended for students without
programming background.
Corerequisite: MTH 111. Credits: 4.
The theory of limits, the derivative and the definite inegral, techniques
and applications. The sequence MTH 131-132 is more conceptually oriented
than MTH 110-112.
Prerequisite: MTH 108 or adequate achievement
on Mathematics Placement Test together with completion of
high school trigonometry and analytic geometry.
Not open to students with credit in MTH 110 or 111.
Credits: 4.
Continuation of MTH 131. Additional topics on the derivative
and definite integral; improper integrals,
infinite series, and introduction to differential equations.
Prerequisite: MTH 131.
Not open to students with credit in MTH 112.
Credits: 4.200-Level Courses
Two and three dimensional vectors, inner products, vector
products, matrix algebra, linear transformations,
determinants, quadratic and bilinear forms.
Prerequisite or corequisite: MTH 112 or 132. Credits: 3.
Matrix algebra, vectors in space, partial differentiation,
multiple integrations.
Prerequisite: MTH 112. Not open to students with
credit in MTH 312. Credits: 3.
Programming methodology using Pascal. Linked lists, stacks,
queues, binary trees, files, recursion, elementary searching
and sorting.
Prerequisite: MTH 120. Credits: 3.
Probability distributions, random variables, expection and variance,
point estimation, interval estimation, testing of hypothesis, analysis
of variance.
Prerequisite: One semester of calculus. Credits: 3.
Fundamentals of set theory, logic and methods of
mathematical proof.
Prerequisite or corequisite: MTH 112 or 132. Credits: 3.
300-Level Courses
Mathematical methods of Computer Science and Computer Engineering.
Mathematcial reasoning, sets, relations, functions, boolean
algebra, combinatorics, graphs.
Prerequisite: MTH 111. Credits: 3.
Equations of curves, surfaces, solids; vector differential
calculus; integration of scalar valued functions.
Applications
Prerequisite: MTH 210 and (112 or 132).
Note open to students with credit in MTH 533. Credits: 3.
Linear differential equations, simultaneous equations, solutions in
series, numerical solutions.
Prerequisite: MTH 112 or 132. Credits: 3.
Vector algebra, partial differentiation, multiple integration,
scalar and vector fields, line and surface integrals.
Prerequisite: MTH 112. Not open to students with credit
in MTH 211. Credits: 3.
Same course as MTH 220.
Interpolation, quadrature, numerical solution of algebraic
and transcendental equations, matrix inversion.
Prerequisite: MTH 210 or 211; knowledge of a structured
programming language. Credits: 3.
Fundamentals of C programming in the UNIX environment: character
and string manipulations, pointer arithmetic, functions, structures,
systems calls and shell programming.
Prerequisite: MTH 111, 120 Credits: 3.
400-Level Courses
500-Level Courses
Axiom systems and models of Euclidean and Non-Euclidean geometry.
Prerequisite: MTH 230 or 309. Credits: 3.
Propositional and first-order logic: completeness. Computational
logic: Robinson's resolution. Formalized theories: arithmetic, Godel's
incompleteness theorem, Tarski's theorem on undefinability of truth.
Prerequisite: MTH 230 or 309 or permission of the
instructor.
Algebraic systems, equivalence classes, groups, rings, fields,
unique factorization domains.
Prerequisite: MTH 210 and 230. Not open to students with
credit in MTH 509 or 561. Credits: 3.
Groups and combinatorics; applications of group theory to
computer design and error correcting codes; Semigroups and
their applications to finite state machines; rings and fields;
applications of Boolean algebra to computer design.
Prerequisite: MTH 210, 309. Credits: 3.
Complex variables; conformal mapping, contour integraion.
Prerequisite: MTH 211 or 310. Credits: 3.
Derivation, well posedness, and qualitative properties of initial value
and boundary value problems for the heat, wave and Laplace equations.
Energy methods, causality, maximum principles, heat kernels, Fourier
series, and potential theory.
Prerequisite: MTH 210, 311 and either MTH 310 or 312. Credits:
3.
Continuation of MTH 513. Approximations of solutions, distributions and
integral transform methods, spectral theory and scattering. Applications
to physical problems. Nonlinear equations and phenomena.
Prerequisite: MTH 513 or permission of the instructor. Credits: 3.
Linear systems, equilibria and periodic solutions, stability analysis,
bifurcation, phase plane analysis, boundary value problems, applications
to engineering and physics.
Prerequisites: MTH 311 and either MTH 211 or 310. Credits: 3.
Bifurcation of equilibria and periodic solutions, global theory of
planar systems, planar maps, nonlinear vibrations, forced oscillations,
chaotic solutions, Hamiltonian systems, applications to engineering and
physics.
Prerequisites: MTH 515 or permission of the instructor.
Credits: 3.
Data abstraction, formal specification, trees, B-trees, balanced
binary trees, graphs, searching and sorting.
Algorithm analysis. Memory management.
Prerequisite: MTH 220 and 309. Credits: 3.
Translation of higher-level languages into machine language. Topics
in computer translation theory include grammars, parsing, scanners
precedence relations, run-time storage and symbol table organization,
semantic routines, chaining and hashing, code generation and optimization,
and macro implementation.
Prerequisite: MTH 519. Credits: 3.
Formal definition of programming languages including specification of
syntax and semantics; simple statements; global properties of
algorithmic languages including scope of declarations, storage
allocations, grouping of statements, subroutines, coroutines, and tasks;
run time representation of program and data structures.
Prerequisite: MTH 517. Credits: 3.
Numerical linear algebra including the algebraic eigenvalue problem.
Prerequisite: MTH 320 or permission of department chairman.
Credits: 3.
Numerical solution of ordinary and partial differential equations.
Prerequisite: MTH 320 or 520 or permission of department chairman.
Credits: 3.
Theory and design of database systems with empahsis given to
relational techniques. Topics include relational algebra and
calculus, filing structures, relational modeling, query languages,
and optimization.
Prerequisite: MTH 517. Credits: 3.
Probability spaces, random variables, expectation, limit theorems.
Prerequisite: MTH 310 or permission of department chariman.
Probability distributions, theory of sampling and hypothesis
testing.
Prerequisite: MTH 524. Credits: 3.
Finite-state automata, context-free grammars, pushdown automata,
Turing machines and computability.
Prerequisite: MTH 309 or 508. Credits: 3.
Permutations and combinations, generating functions, enumerative analysis.
Prerequisite: One of the following: MTH 508, 509 or 561.
Credits: 3.
Transformations, sequences, and geometry by graphical methods:
representaion, manipulation and display of geometric information,
2--D and 3--D representaions, transformations and display
techniques, display and input devices, software packages.
Prerequisite: MTH 517. Credits: 3.
Set algebra, cardinal and ordinal numbers, axiom of choice, topological
spaces, compactness, connectedness, separation properties, quotient
spaces, Tychonoff Theorem, compactification.
Prerequisite: Permission of department chairman. Credits: 3
each.
Numerical sequences and series; continuity; differentiation;
integration; sequences and series of functions; Fourier series;
functions of several variables; implicit and inverse function theorems.
Prerequisite: MTH 211 (or 310) and 230. Credits: 3.
Continuation of MTH 533.
Prerequisite: MTH 533. Credits: 3.
Design techniques include divide-and-conquer,
greedy method, dynamic programming, backtracking.
Time and space complexity. Sorting, searching, combinatorial
and graph algorithms.
Prerequisite: MTH 517. Credits: 3.
Artificial Intelligence principles and methods; game theory,
optimal strategies, logical reasoning, heuristic and adaptive
programming; Lisp and/or Prolog.
Prerequisite: MTH 220 or 317 Credits: 3.
Groups, rings; linear algebra; modules.
Prerequisite: MTH 210 and permission of department chairman.
Credits: 3.
Continuation of MTH 561.
Prerequisite: MTH 561. Credits: 3.
Virtual Machine, memory hierarchy and organizations,
resource allocation, process models and interprocess synchronization
and communication, communication protocols. Local and Wide Area Networks:
OSI models, current technologies and topics of interest.
Case study of Unix and the Internet.
Prerequisite: MTH220 or 317. Credits: 3.