Telephone: (401) - 865 - 2334
| Home | Faculty | E-mail | Degrees | Students | Sources | PC |
Courses
Chairperson: Prof. Jeffrey T. Hoag
| Home | Faculty | E-mail | Degrees | Students | Sources | PC |
Local Links - Mathematics - Computer Science - Graduate
This course is designed to introduce the student with a minimum math
background to the problem solving process within relevant mathematical
areas. Topics will be selected from mathematical logic, the problem solving
process, probabilistic models, statistical inference, consumer mathematics,
and basic computer programming.
A basic introduction to the properties and applications of functions, linear
systems and probability, for students in business and the social sciences.
Topics include linear equations and inequalities, functions, graphs, solving
systems of simultaneous linear equations, matrices, probability, mathematics
of finance, and an introduction to differential calculus.
A basic introduction to the properties and application of the calculus, for
students in business and social sciences. Topics include differentiation,
integration, and the logarithmic and exponential functions.
An introduction to the basic theory of differential and integral calculus with
applications in the biological and social sciences. This course introduces
students to one-variable calculus and covers topics in limits and
differentiation. The emphasis is on applications of calculus to problems in the
biological and social sciences. Not open to students with credit in mth 131.
A continuation of MTH 109. This course covers topics in integration in
one-variable calculus and gives an introduction to the calculus of functions of
two variables. Not open to students with credit in mth 132.
This course is designed to introduce the student to the various discrete
topics needed for the study of computer science. These topics include set
theory, function theory, logic, proof theory, combinatorics, induction,
recursion, the algorithmic process, algebraic structures, and graph theory.
Formerly MTH 201.
This course is required for all mathematics, EPS, and chemistry & biochemistry
majors. An introduction to one-variable calculus, to some of its uses and to the
ideas that underlie the subject. The main topics are limits and differentiation.
This course is more theoretical in its approach than mth 109. It includes
trigonometric functions, a topic not covered in mth 109. Not open to students
with credit in mth 109.
This course is required for all mathematics, EPS, and chemistry & biochemistry
majors. A continuation of mth 131. The main topics are integration, sequences,
and series, and applications of integration. Not open to students with credit
in mth 110.
A systematic study of the basic concepts of linear algebra. Topics include
systems of linear equations, matrices, determinants, finite dimensional
vector spaces, linear transformation, eigenvalues, eigenvectors and
diagonalization.
An introductory course for the student interested in applications of
statistical methods. Topics include probability, sampling, estimation,
hypothesis testing, variance analysis, correlation, and regression.
This course is required for all mathematics, EPS, and chemistry majors, and is
recommended for biochemistry majors. A continuation of mth 132. The main topic
is multivariable calculus.
This course is designed to aid the student in the transition from calculus
to the study of advanced courses in mathematics. Topics in logic,
set theory, relations, functions, cardinality, and algebra will be
discussed. Emphasis will be placed on the rigorous deductive process
characteristics of the study of mathematics and computer science.
Prerequisite: Calculus or permission of instructor
An introduction to aspects of logic appropriate to both
the mathematics and computer science student. Topics in propositional and
predicate logic, formal theories, commputability and metamathematics
will be discussed. Prerequisite: Calculus or permission of instructor
Theory of linear differential equations and methods of solution, including
series and transforms. Prerequisite: MTH 223
An introduction into the basic techniques of combinatorial mathematics
including fundamental enumeration principles and algebraic counting techniques.
The aim of this course is to familiarize the student with the principles of
deductive reasoning through geometry. Topics include a review of the basic
concepts encountered in Euclidean geometry and a historical development of
non-Euclidean geometry.
Required for all mathematics majors. An introduction to the elementary theory of
groups. Topics: the basic properties of groups, Cayley tables, examples of
groups, finite and infinite groups, abelian and non-abelian groups, subgroups
and their properties. Cyclic Groups (including the fundamental theorem), the
permutation and dihedral groups and their subgroups, group isomorphism and
Cayley’s theorem, group homomorphisms, Lagrange’s theorem, normal subgroups and
factor groups, direct products and the fundamental theorem of abelian groups.
Prerequisites: mth 215 and 301 or permission of instructor.
Essential for anyone thinking of attending graduate school in mathematics.
Topics include: the basic properties of rings, commutative and non-commutative
rings, integral domains, rings with non-zero characteristic, ring
homeomorphisms, polynomial rings, ideals, principal ideal domains, prime and
maximal ideals, factor rings, factoring and decomposition problems (including
Eisenstein’s Criterion), finite fields (existence and construction of), unique
factorization domains, irreducible and prime elements, Euclidean domains, an
introduction to field extensions. Prerequisite: mth 315 or permission of instructor.
An investigation into the basic properties of the integers. Topics include
sums of squares, divisibility, the Chinese remainder theorem, and quadratic
reciprocity law.
Axioms for the real numbers, topology of the real numbers, Heine-Borel theorem,
Bolzano-Weierstrass theorem, continuous and uniformly continuous functions,
extreme and intermediate value theorems, differentiable functions, mean value
theorem, Taylor's theorem, Riemann integral, fundamental theorem of calculus,
sequences and series of functions, topology of Euclidean space, differentiation
and integration in Euclidean space, inverse function theorem. Prerequisite:
mth 110, mth 132, or mth 223.
A continuation of mth 323. Prerequisite: mth 323.
An introduction into the fundamental techniques and basic concepts of graph
theory. Topics include enumeration, connectivity, colorability,
traversability, and external problems.
In this course the student has the opportunity to investigate in detail an
area or topic in mathematics. Both the topic and instructor(s) should be
selected by the student. Permission to register for this course must be
obtained by the instructor(s) whose guidance is sought.
The axiom of Choice and its equivalences, metric and topological spaces,
compactness, connectedness, separation, continuous maps and their
invariants, the structure of C(X,R), the Stone-Cech Compactification, and
the Stone-Weierstrass Approximation theorems. Prerequisites: MTH 324 and
permission of the instructor
The structure of the complex field, differentiation, the line integral and
its applications, series, and conformal mappings are studied. Prerequisites:
MTH 315, 323 and permission of the instructor
Selected topics in advanced calculus, and applied mathematics, including
topics in partial differential equations, Fourier Series, optimization,
linear algebra, and numerical methods. Prerequisite: MTH 223
An introduction to probability theory and mathematical statistics. It will
include a discussion of various probability distributions and their moments,
limit theorems, classical and Bayesian inference and estimation, regression,
correlation, and non-parametric methods. Prerequisite: MTH 223
An introduction to the history of mathematics, beginning with the origin of
mathematics in the great civilizations of antiquity and progressing through
the first few decades of this century. Prerequisite: One year of the calculus
This course is the same as CSC 440. Applications of the digital computer to
solutions of problems. Topics included are solutions to non-linear
equations, polynomial interpolation and approximation, numerical
differentiation and integration, and curve fitting. Prerequisite: MTH 110 or 132
This is a terminal course intended to introduce the student to the programming language BASIC and to popular software such as spreadsheets, word processing, and data base management.
This course will introduce the student to digital computer concepts and technical skills. It is intended for students in a technical discipline and those who plan to continue the study of computer science. This course will meet four hours a week, including one hour in the computer lab.
In this course advanced computer science theories will be investigated using
a high-level structured computer language. This course will meet four hours
a week, including one hour in the computer lab. Prerequisite: CSC 103, MTH
108 or 110 or 131
This course is an introduction to COBOL, the major language used in business
and data processing. Prerequisite: CSC 101, CSC 103 or MGT 203
An introduction to computers for the prospective teacher. Topics include the
terminology and history of computers and the use of computers as a tutor, as
a tool for administrative tasks, and as an aid in problem solving.
This course is intended to introduce the student to a variety of data
structure representations. Program efficiency is directly related to
choosing the correct form of data representation. Topics include stacks,
queues, linked lists, trees, and graphs. The implementation issues are
thoroughly covered. This course will meet four hours a week, including one
hour in the computer lab. Prerequisite CSC 104
This course is intended to develop the knowledge and skill necessary to
program with facility using the non-privileged instruction set of the
ASSEMBLER language of a third-generation byte-oriented system. It is
intended for those desiring a depth of knowledge in the internal instruction
and operations of the computer. Prerequisite: CSC 104
Introduction to digital systems, covering both combinatorial and sequential
circuits. The digital concepts will be introduced at the digital component
level and the systems level, allowing the student to gain a better
understanding of computer organization. Topics include Boolean Algebra,
coding schemes-such as a grey code, timing considerations, design
techniques, and hardware organization in general. If time permits,
microprocessor and microprogramming operations will be discussed.
Prerequisite: CSC 230
In this course the student has the opportunity to investigate in detail an
area or topic in computer science. Both the topic and instructor(s) should
be selected by the student. Permission to register for this course must be
obtained by the instructor(s) whose guidance is sought.
Problem solving techniques, game playing, data structure representations,
tree searching strategies, and predicated calculus are among the basic
topics discussed. A conceptual understanding of the basic topics will allow
the student to progress to the more advanced areas of A.I. If the time
permits, some of the more advanced topics will be surveyed. Prerequisite:
CSC 225
The student is introduced to concepts and structures necessary to design and
implement a database management system. Topics include data models, data
normalization, data integrity, file organization, and file security.
Prerequisite: CSC 225
This course is an introduction to some of the software techniques and data
structures that are used in implementing interactive computer graphics
projects. The student will become familiar with some of the major hardware
features, and some of the input and display devices used in graphics
applications. Using a high level language, the student will implement a
collection of graphics procedures that incorporate the ideas of one of the
field's main graphics standards. Prerequisite: CSC 104
This course is an introduction to the theory of computer networks based on
the standard seven layer OSI model of networks. Topics included are the
physical layer of the model, IEEE standards for LAN's error detecting and
correcting codes, the simplex protocol for the data link layer, transport
algorithms, public key cryptography, and network operating systems. Examples
may be taken from ARPANET, Ethernet, and protocols such as MAP and TOP.
Prerequisite: CSC 225
This course is the same as MTH 440. Applications of the digital computer to
solutions of problems. Topics included are solutions to non-linear
equations, polynomial interpolation and approximation, numerical
differentiation and integration, and curve fitting. Prerequisite: MTH 110 or 132
Management of core memory and peripheral device allocation including job
schedules, input-output schedules, swapping overlay management in a
multi-programming environment will be discussed. Prerequisite: CSC 230