| MATH 300. FOUNDATIONS OF ADVANCED MATHEMATICS (S)(WI) |
| This course is an introduction to communication in mathematics
as well computational tools for mathematics. This writing intensive
course provides a transition from the Calculus sequence to the upper-
division mathematics curriculum at CSM. Topics include logic and
recursion, techniques of mathematical proofs, reading and writing
proofs, mathematics software. |
Prerequisite: MATH 213, 223 or 224.
2 hours lecture, 1 hour seminar, 2 hours lab; 4 semester hours. |
| CSCI 306. SOFTWARE ENGINEERING (I,II) |
| Introduction to the software life cycle, including planning,
design, implementation and testing. Topics include top down program
design, problem decomposition, iterative refinement, program modularity and
abstract data types. Course work emphasizes good programming practices
via models, metrics and documents created and used throughout the
software engineering process. |
Prerequisite: CSCI 262.
3 hours lecture; 3 semester hours. |
| MATH 323. PROBABILITY AND STATISTICS FOR ENGINEERS I (I,II,S) |
| Elementary probability, propagation of error, discrete and
continuous probability models, interval estimation, hypothesis testing,
and linear regression with emphasis on applications to science and
engineering. |
Prerequisite: MATH 213, 223 or 224.
3 hours lecture; 3 semester hours. |
| MATH 332. LINEAR ALGEBRA (I,II) |
| Systems of linear equations, matrices, determinants and
eigenvalues. Linear operators. Abstract vector spaces.
Applications selected from linear programming, physics, graph
theory, and other fields. |
Prerequisite: MATH 213, 223 or 224.
3 hours lecture; 3 semester hours. |
| MATH 334. INTRODUCTION TO PROBABILITY (I) |
| An introduction to the theory of probability essential for
problems in science and engineering. Topics include axioms of
probability, combinatorics, conditional probability and
independence, discrete and continuous probability density functions,
expectation, jointly distributed random variables, Central Limit
Theorem, lawas of large numbers. |
Prerequisite: MATH 213, 223 or 224.
3 hours lecture; 3 semester hours. |
| MATH 335. INTRODUCTION TO MATHEMATICAL STATISTICS (II) |
| An introduction to the theory of statistics essential for
problems in science and engineering. Topics include sampling
distributions, methods of point estimation, methods of interval
estimation, significance testing for population means and
variances and goodness of fit, linear regression, analysis of
variance. |
Prerequisite: MATH 334.
3 hours lecture; 3 semester hours. |
| CSCI/MATH 340. COOPERATIVE EDUCATION (I,II,S)(WI) |
| Supervised, full-time engineering-related employment for a
continuous six-month period (or its equivalent) in which specific
educational objectives are achieved. |
Prerequisite: Second semester sophomore status and a
cumulative grade point average of at least 2.00.
0 to 3 semester hours.
Cooperative Education credit does not count toward graduation except under special conditions. |
| CSCI 341. COMPUTER ORGANIZATION(I,II) |
| Covers the basic concepts of computer architecture and
organization. Topics include machine level instructions and
operating system calls used to write programs in assembly language.
This course provides insight into the way computers operate at the
machine level. |
Prerequisite: CSCI 261.
3 hours lecture; 3 semester hours. |
| MATH 342. HONORS LINEAR ALGEBRA (II) |
| Same topics as those covered in MATH 332 but with additional
material and problems as well as a more rigorous presentation. |
Prerequisite: MATH 213, 223 or 224.
3 hours lecture; 3 semester hours. |
| MATH 348. ADVANCED ENGINEERING MATHEMATICS (I, II, S) |
| Introduction to partial differential equations, with
applications to physical phenomena. Fourier series. Linear algebra,
with emphasis on sets of simultaneous equations. |
This course cannot be used as an MATH elective by MCS majors.
Prerequisite: MATH 225 or 235.
3 hours lecture; 3 semester hours. |
| CSCI/MATH 358. DISCRETE MATHEMATICS & ALGEBRAIC STRUCTURES (I,II) |
| This course is an introductory course in discrete mathematics
and algebraic structures. Topics include: formal logic; proofs,
recursion, analysis of algorithms; sets and combinatorics; relations,
functions, and matrices; Boolean algebra and computer logic; trees,
graphs, finite-state machines, and regular languages. |
Prerequisite: MATH 213, 223 or 224.
3 hours lecture; 3 semester hours. |
| CSCI 370. FIELD COURSE (S)(WI) |
| This is the Computer Science option's capstone course
where the students apply their course work knowledge to a
challenging applied problem in mathematics or computer science.
In this course they analyze, modify and solve a significant
applied problem. The students work in groups of three or four
for a period of six forty-hour weeks. By the end of the field
session they must have a finished product with appropriate
supporting documents. |
At a minimum CS students should have completed coursework
through CSCI 306.
Prerequisite: Consent of Instructor.
6-week summer field session; 6 semester hours. |
| CSCI/MATH 398. SPECIAL TOPICS (I,II,S) |
| Selected topics chosen from special interests of instructor
and students. |
Prerequisite: Consent of Department Head.
1 to 3 semester hours. |
| CSCI/MATH 399. INDEPENDENT STUDY (I,II,S) |
| Individual research or special problem projects supervised by
a faculty member; also, when a student and instructor agree on a
subject matter, content and credit hours. |
Prerequisite: Independent Study form must be completed and
submitted to the Registrar.
Variable Credit: 1 to 6 semester hours. |
