Support Courses for the Computer and Information Studies Major
Updated: 2 July 2003

   As indicated on the flow sheet, the Computer and Information Studies Major requires the completion of five support courses in Mathematics, and (for those students admitted to the Computer and Information Studies Major in January 2003 or later) one support course in Digital Circuit Design (offered by the Chemistry and Physics Department).   Descriptions of these support courses appear below.   The prerequisites shown for some of the Mathematics courses differ from those in the current printed catalog and will be in effect as of Spring 2004.

PHS 205 Digital Circuit Design 4 cr.
Introduction to D.C. circuit analysis and digital logic design.   Topics include: D.C. circuit analysis, fundamental building blocks of modern computers (binary number system, Boolean algebra, logic gates, logic circuits), counters and registers, integrated circuit logic, methods of analog-to-digital and digital-to-analog conversions, computer organization (CPU and main memory, read-only memory, cache storage, buses, serial and parallel comunication), and secondary storage media such as magnetic and optical disks. Four lecture hours per week.
Co-requisite: MAT 202N or equivalent.

MAT 220 Calculus I 4 cr.   DII
This course includes functions and their limits, slopes and tangent lines, differentiation rules (including those for trigonometric functions), Chain Rule, linearizations, approximations, Newton's method, extreme values and curve sketching, optimization, and the Mean Value Theorem and its applications.   Also included is an introduction to integration with applications to area between curves, the Fundamental Theorems of Integral Calculus and the basic integration techniques.   Four lecture hours per week.   Not open to students who have received credit for MAT 210.
Prerequisite: Knowledge of algebra and trigonometry is assumed.

MAT 221 Calculus II 4 cr.   DII
This course is a further development of the calculus of functions of one variable.   Topics include logarithmic and exponential functions and their derivatives and integrals, exponential growth and decay, inverse trigonometric functions, techniques of integration, numerical integration with error estimates, applications of the integral indeterminate forms and l'Hopital's rule, infinite sequences and infinite series with error estimation.   Not open to students who have received credit for MAT 211.   Four lecture hours per week.
Prerequisite: MAT 220.

MAT 214 Discrete Structures 3 cr.   DII
A study of discrete mathematical structures of interest in computer science and other applied fields.   Applications-oriented study of formal logic, algebra of sets, permutations and combinations, mathematical induction, recursion, graphs, trees, logic gates and circuits, and finite state machines.   Three lecture hours per week.   Not open to students who have received credit for MAT 314.
Prerequisite: MAT 210 or MAT 220.

MAT 247 Statistics I 3 cr.   DII
An elementary introduction to statistical concepts, probability, frequency distributions, sampling, testing of hypotheses, and linear regression.   The emphasis is on practical and usable results, rather than on mathematical derivations.   This course can prepare the student for the use of statistics in business, economics, the social sciences, or education.   Not open to Mathematiucs majors without permission of the Department Chairperson.   Three lecture hours per week.
Prerequisite: MAT 104N or completion of the Basic College Mathematics Competency requirement.

     In addition to the four specific Mathematics courses listed above, one additional MAT course must be selected from the following list:

MAT 304A Linear Algebra I 3 cr.   DII
A systematic study of vector spaces and linear transformations, including the algebra of matrices, determinants, inner products, eigenvalues, and eigenvectors.   Three lecture hours per week.
Prerequisite: MAT 214 or MAT 221.

MAT 308 Linear Programming 3 cr.   DII
Topics studied: linear equations and inequalities, convex regions, the simplex algorithm, duality and minimax theorems, matrix games, transportation and assignment problems.   Experience is provided in the computer solution of linear programming problems and in applications to business and the sciences.   Three lecture hours per week.
Prerequisite: MAT 210 or MAT 220 or equivalent.

MAT 316 Combinatorial Mathematics 3 cr.
A survey of combinatorial methods, including graphs, trees, networks, permutations and combinations, partitions, and enumeration theory.   Three lecture hours per week.
Prerequisite: MAT 214 or MAT 221.

MAT 323 Numerical Analysis 3 cr.
A study of numerical methods.   Topics include root finding for non-linear equations, polynomial interpolation, series methods, numerical integration, finite differences, and solutions of linear systems.   Efficiency, accuracy and round off and truncation errors are considered.   Computer implementation of selected methods is included.   Three lecture hours per week.
Prerequisite: MAT 221.



Salem State Home • Computer Science Home • Faculty • Computer Studies Major • Flow Sheet
Computer Studies Minor • Courses • Course Sequence Diagram • Computer Laboratories