CMSC 203 - Discrete Structures

Number of Credits: 3
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 Term Only) Three hours lecture each week. Three Credits. Three billable hours.

Pre-requisite(s): Pre-requisite(s): MATH 135 Calculus of a Single Variable 1
Course Topics:
Proof techniques

Mathematical induction

Set Theory

Logic

Functions

Relations

Graph Theory

Number Theory

Course Objectives: Upon successful completion of this course, students will be able to:

Explore the language and concepts of sets, relations, functions, and graphs. (PG 1, PG 4)
Apply logic concepts of truth tables, logical equivalence, tautologies, contradictions, conditionals, contrapositives, converses, and inverses of compound statements to solving problems in computer science. (PG 1, PG 4)
Apply methods of direct and indirect proofs to elementary number theory problems. (PG 1, PG 4)
Solve sequence problems using recursion and Mathematical Induction. (PG 1, PG 4)
Examine the concepts of set theory and prove related set identities and properties. (PG 1, PG 4)
Evaluate properties of functions and relations. (PG 1, PG 4)