Syllabus Information |
Spring 2013
Jun 09,2026 |
|
 |
||
 | Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |
| MTH 233 - Discrete Mathematics 3 |
|---|
|
Associated Term:
Spring 2013
Learning Objectives: Upon successful completion of this course, the student should be able to: 1. Use elementary combinatorics techniques including combinations and permutations to enumerate sets. 2. Understand terms commonly associated with relations, functions, matrices, and graph trees. 3. Do preorder, inorder, postorder traversals of trees. 4. Use array representations of trees and graphs. 5. Prove elementary properties of graphs and trees. 6. Use Prim’s and Kruskal’s algorithms. 7. Determine and describe Hamiltonian and Euler circuits. 8. Understand terms used with finite-state automata. 9. Design, use and simplify finite-state automata. Required Materials: Technical Requirements: |
| Return to Previous | New Search |
|