CMSC203 — Discrete Structures
Add to Personal Bookmarks Number of Construct arguments to prove statements in number theory, set theory, logic, functions, relations, and graph theory. Employ direct and indirect proof techniques along with the principle of mathematical induction. Apply methods of proof and problem-solving skills to formulate different approaches to solving problems seen in Computer Science. (Spring) Three hours lecture each week. Three Credits. Three billable hours. Apply logic concepts of truth tables, logical equivalence, tautologies, contradictions, conditionals, contrapositives, converses, and inverses of compound statements to solving problems in computer science. Apply methods of direct and indirect proofs to elementary number theory problems. Solve sequence problems using recursion and Mathematical Induction. Examine the concepts of set theory and prove related set identities and properties. Evaluate properties of functions and relations.
Prerequisites: MATH135