# Discrete Math For Information Technology – mth221 (3 credits)

Discrete (as opposed to continuous) mathematics is of direct importance to the fields of Computer Science and Information Technology. This branch of mathematics includes studying areas such as set theory, logic, relations, graph theory, and analysis of algorithms. This course is intended to provide students with an understanding of these areas and their use in the field of Information Technology.

This undergraduate-level course is 5 weeks. This course is available to take individually or as part of a degree or certificate program. To enroll, speak with an Enrollment Representative.

### Boolean Logic and Algebra

• Use the basic laws of Boolean algebra.
• Convert Boolean expressions into a disjunctive or conjunctive normal form.
• Apply the basic concepts of Boolean algebra.

### Algorithmic Concepts, Relations & Functions Part 1

• Apply the basic concepts of computational complexity and algorithmic analysis.
• Apply the principles of mathematical induction and recursion.
• Solve problems of iteration.
• Manipulate relations and simple functions and their inverses.

### Basic Enumeration, Logic and Set Theory

• Apply basic enumeration techniques.
• Simplify assertions and compound statements in first-order logic.
• Apply basic set-theoretic concepts.

### Relations & Functions Part 2 & More Enumeration

• Use the properties of relations.
• Apply the properties of equivalence relations and partitions.
• Use the Principle of Inclusion and Exclusion.

### Graph Theory and Trees

• Identify graph isomorphisms, planarities, connected components, and chromatic numbers.
• Identify properties of a tree.
• Apply properties of general graphs.