Course Description: Mth 232 is the second of two courses designed to introduce concepts of mathematics applicable to the field of computer science. Topics in the course will examine in detail the applied, real–world, and theoretical mathematical implications of the mathematical concepts of functions, combinatorics, and graph theory. The symbolic, numerical, and graphical representations of the mathematical concepts will be expanded and explored. Emphasis will be on solving problems symbolically, numerically and graphically and understanding the connections among these methods in interpreting and analyzing results.
Mth 232 has the competencies from Mth 231: Elements of Discrete Mathematics II as prerequisites; the course is college-transferable. Mth 232 is a 4 credit hour (quarter system) course.
Performance Based Outcomes in Mathematics
Students who successfully complete any mathematics course at Central Oregon Community College will be able to:
1. Work independently to explore mathematical applications and models, and to develop algebraic/symbolic, graphical, numerical, and narrative skills in solving mathematics problems.
2. Work as a member of a group/team on projects or activities that are designed to explore mathematical applications and models.
3. Use both written and oral skills to communicate about mathematical concepts, processes, complete mathematical solutions and their implications.
4. Use a variety of problem solving tools including symbolic/algebraic notation, graphs, tables, and narratives to identify, analyze, and solve mathematical problems.
5. Develop mathematical conjectures and use examples and counterexamples to examine the validity and reasonableness of those conjectures.
6. Create and analyze mathematical models of real world and theoretical situations, including the implications and limitations of those models.
7. Use appropriate technologies to analyze and solve mathematics problems, and verify the appropriateness and reasonableness of the solution(s).
Specifically, students who complete Math 232: Elements of Discrete Mathematics II will be able to:
• model and solve applied, real–world, and theoretical mathematical problems requiring the application of operations of combinatorics including counting principles, both finite and infinite cardinality, combinations and permutations.
• determine and analyze problems requiring an understanding of functions including graphical and symbolic representations of onto, one–to–one, and recursive functions.
• solve problems and apply the principles of graph theory including directed and undirected graphs, paths and circuits, and trees to applications in computer science.
• solve problems and represent graphs using the notation and methods of matrix algebra with applications in computer science.
• understand and analyze algorithms with applications to computational complexity, searching and sorting, and other applications in computer science.