OSU-MTH231

From

(Difference between revisions)
Jump to: navigation, search
 
Line 1: Line 1:
:'''MTH 231 Elements of Discrete Mathematics (4)'''<br>  
:'''MTH 231 Elements of Discrete Mathematics (4)'''<br>  
-
:<u>Learning Outcomes</u>.<br> A successful student in MTH 231 will be able to:<br> 1. Apply basic set operations and DeMorgan’s Laws.<br> 2. Apply propositional calculus.<br> 3. Negate compound and quantified statements.<br> 4. Form contrapositives.<br> 5. Construct direct proofs (from definitions) of simple statements.<br> 6. Apply the Principle of Mathematical Induction.<br> 7. Demonstrate an understanding of the construction of proofs by contradiction and contraposition.<br> 8. Understand and use the graphical and matrix representations of binary relations.<br> 9. Understand and use equivalence relations.<br> 10. Understand and use asymptotic notation.<br><!--Please be mindful of the talk page discussions that have determined this template's appearance.-->
+
:<u>Learning Outcomes</u>.<br> A successful student in MTH 231 will be able to:<br> 1. Apply basic set operations and DeMorgan’s Laws.<br> 2. Apply propositional calculus.<br> 3. Negate compound and quantified statements.<br> 4. Form contrapositives.<br> 5. Construct direct proofs (from definitions) of simple statements.<br> 6. Apply the Principle of Mathematical Induction.<br> 7. Demonstrate an understanding of the construction of proofs by contradiction and contraposition.<br> 8. Understand and use the graphical and matrix representations of binary relations.<br> 9. Understand and use equivalence relations.<br> 10. Understand and use asymptotic notation.<br> <!--Please be mindful of the talk page discussions that have determined this template's appearance.-->11. Use inductive arguments to construct and solve models based on first-order and second-order linear constant coefficient difference equations.<br>

Current revision as of 19:16, 31 October 2011

MTH 231 Elements of Discrete Mathematics (4)
Learning Outcomes.
A successful student in MTH 231 will be able to:
1. Apply basic set operations and DeMorgan’s Laws.
2. Apply propositional calculus.
3. Negate compound and quantified statements.
4. Form contrapositives.
5. Construct direct proofs (from definitions) of simple statements.
6. Apply the Principle of Mathematical Induction.
7. Demonstrate an understanding of the construction of proofs by contradiction and contraposition.
8. Understand and use the graphical and matrix representations of binary relations.
9. Understand and use equivalence relations.
10. Understand and use asymptotic notation.
11. Use inductive arguments to construct and solve models based on first-order and second-order linear constant coefficient difference equations.
Personal tools
MediaWiki Appliance - Powered by TurnKey Linux