OSU-MTH232

From

(Difference between revisions)
Jump to: navigation, search
 
Line 1: Line 1:
-
:MTH 232 Learning Outcomes.<br> A successful student in MTH 232 will be able to:<br> 1. Understand and construct direct proofs, including proofs using the Principle of Mathematical Induction.<br> 2. Construct simple proofs using contradiction and contraposition.<br> 3. Demonstrate an understanding of the logical foundation of some simple algorithms.<br> 4. Use the Sum Rule and Product Rule in combinatorial arguments.<br> 5. Construct complete explanations for solutions to counting problems.<br> 6. Demonstrate a basic understanding of discrete probability.<br> 7. Understand and apply Bayes’ Theorem.<br> 8. Understand and use the matrix representation of finite graphs.<br> 9. Use graphs to model systems.<br> 10. Use at least one algorithm for finding a minimal spanning tree in a connected graph.
+
:'''MTH 232 Elements of Discrete Mathematics (4)'''
 +
'''<u></u>'''<u>Learning Outcomes</u>.<br> A successful student in MTH 232 will be able to:<br> 1. Understand and construct direct proofs, including proofs using the Principle of Mathematical Induction.<br> 2. Construct simple proofs using contradiction and contraposition.<br> 3. Demonstrate an understanding of the logical foundation of some simple algorithms.<br> 4. Use the Sum Rule and Product Rule in combinatorial arguments.<br> 5. Construct complete explanations for solutions to counting problems.<br> 6. Demonstrate a basic understanding of discrete probability.<br> 7. Understand and apply Bayes’ Theorem.<br> 8. Understand and use the matrix representation of finite graphs.<br> 9. Use graphs to model systems.<br> 10. Use at least one algorithm for finding a minimal spanning tree in a connected graph.
 +
 
:&nbsp;<!--Please be mindful of the talk page discussions that have determined this template's appearance.-->
:&nbsp;<!--Please be mindful of the talk page discussions that have determined this template's appearance.-->

Current revision as of 18:55, 2 November 2011

MTH 232 Elements of Discrete Mathematics (4)

Learning Outcomes.
A successful student in MTH 232 will be able to:
1. Understand and construct direct proofs, including proofs using the Principle of Mathematical Induction.
2. Construct simple proofs using contradiction and contraposition.
3. Demonstrate an understanding of the logical foundation of some simple algorithms.
4. Use the Sum Rule and Product Rule in combinatorial arguments.
5. Construct complete explanations for solutions to counting problems.
6. Demonstrate a basic understanding of discrete probability.
7. Understand and apply Bayes’ Theorem.
8. Understand and use the matrix representation of finite graphs.
9. Use graphs to model systems.
10. Use at least one algorithm for finding a minimal spanning tree in a connected graph.

 
Personal tools
MediaWiki Appliance - Powered by TurnKey Linux