CR: MATH 1104 Learning Objectives: Difference between revisions
| (3 intermediate revisions by the same user not shown) | |||
| Line 11: | Line 11: | ||
Linear Algebra for Computer Science | Linear Algebra for Computer Science | ||
*Topics: | *Topics: | ||
**Number Theory: Z, GCD, Primes and Relative Primes, MOD, Euclidean Algorithm, Prime | **Number Theory: Z, GCD, Primes and Relative Primes, MOD, Euclidean Algorithm, Prime Factorization and Fermat's Theorem. | ||
**Matrices: Systems of linear equations, Gaussian Elimination, Matrix algebra and Determinants | **Matrices: Systems of linear equations, Gaussian Elimination, Matrix algebra and Determinants, LU decomposition, | ||
**Functions and Relations: 1-1, onto, bijection, inverse, composition, equivalence relations and partial orders. | **Functions and Relations: 1-1, onto, bijection, inverse, composition, equivalence relations and partial orders. | ||
*Topics Omitted: Complex numbers, Eigenvalues, | |||
*Topics Omitted: Complex numbers, Eigenvalues, | |||
Latest revision as of 18:15, 23 March 2011
Calendar Description
MATH 1104 [0.5 credit] Linear Algebra for Engineering or Science Systems of linear equations. Matrix algebra. Determinants. Complex numbers. Eigenvalues. Diagonalization and applications. Precludes additional credit for BIT 1001, BIT 1101, MATH 1102, MATH 1107, MATH 1109, MATH 1119. Note: MATH 1119 is not an acceptable substitute for MATH 1104. Prerequisite: Ontario Grade 12 Mathematics: Advanced Functions, or MATH 0005, or equivalent, or permission of the School.
New Version MATH 1104 [0.5 credit] Linear Algebra for Computer Science
- Topics:
- Number Theory: Z, GCD, Primes and Relative Primes, MOD, Euclidean Algorithm, Prime Factorization and Fermat's Theorem.
- Matrices: Systems of linear equations, Gaussian Elimination, Matrix algebra and Determinants, LU decomposition,
- Functions and Relations: 1-1, onto, bijection, inverse, composition, equivalence relations and partial orders.
- Topics Omitted: Complex numbers, Eigenvalues,