|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 - 6.00 Credits
I, II, S. 1-6 Hr. PR: Consent. Investigation of topics not covered in regularly scheduled courses.
-
1.00 Credits
I, II. 3 Hr. PR: MATH 126. (Not open to students who have credit for MATH 231.) (For in-service elementary mathematics teachers.) Systems of numeration; sets, relations, binary operations, the algebraic structure of various number systems; the notions of length, area, and volume; coordinate geometry.
-
2.00 Credits
I, II. 3 Hr. PR: MATH 126. (Not open to students who have credit for MATH 231.) (For in-service elementary mathematics teachers.) Systems of numeration; sets, relations, binary operations, the algebraic structure of various number systems; the notions of length, area, and volume; coordinate geometry.
-
3.00 Credits
II. 3 Hr. PR: MATH 283 or consent. A study of groups, rings, and fields together with their substructures, quotients and products, morphisms; the fundamental homomorphism theorems.
-
3.00 Credits
I. 3 Hr. PR: MATH 156. Introduction to vector spaces as an algebraic system. Emphasis on axiomatic development and linear transformation. Examples from geometry and calculus.
-
3.00 Credits
II. 3 Hr. PR: MATH 156 or MATH 150. A problem-solving course focusing on the measurement of interest, annunities, amortization schedules, and sinking funds, and the valuation of bonds and other securities.
-
3.00 Credits
II. 3 Hr. PR: MATH 261. The algebra and differential calculus of vectors, solution of the partial differential equations of mathematical physics, and application of functions of a complex variable.
-
3.00 Credits
3 Hr. PR: MATH 155. Introduces students to the art of confidential communication the mathematical background and the practical skills in making and breaking secret codes.
-
3.00 Credits
I. 3 Hr. PR: MATH 156. Finite fields, algebraic coding theory, Boolean algebras, monoids, finite state, and Turing machines.
-
3.00 Credits
II. 3 Hr. PR: MATH 283. Permutations, combinations, binominal theorem, inclusion-exclusion formula, recurrence relations, generating functions, elementary graph theory (connectivity, paths, circuits, trees, vertex and edge coloring, graph algorithms) matching theory, and discrete optimization. (Equiv. to CS 426.)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|