Maalot Educational Network | Evaluated Learning Experience
Discrete Mathematics (MAT370)
39 hours (13 weeks).
May 2018 - Present.
Upon successful completion of the course, students will be able to: read, interpret and write presentations using logical mathematical symbols; write proofs of truth value of propositions, using inference rules and axioms of logic; use set theory to explain mathematical logic involving collections of objects as units; discuss the concept of algorithms as processes to solve problems; solve a recurrence relation; tell whether a function is injective or subjective; define functions explicitly and recursively; calculate probabilities using counting rules, combinations and permutations; write proofs relating number of vertices and number of edges in a tree; write proofs related to connectedness of graphs; and find shortest path in a graph and compute transitive closure of a relation.
Major topics include: logic and proofs, sets theory, algorithms, functions, induction and recursion, counting, discrete probability, divide and conquer algorithms, relations, equivalence relations, partial ordering, graphs, trees, Boolean algebra, and switching circuits.
In the upper division baccalaureate degree category, 3 semester hours in Mathematics, Business, Finance, Statistics, or Computer Science (5/18) (3/21 revalidation).