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.
Simplify assertions and compound statements in first-order logic.
Apply basic set-theoretic concepts.
Algorithmic Concepts, Relations & Functions Part 1
Apply the principles of mathematical induction and recursion.
Apply the basic concepts of computational complexity and algorithmic analysis.
Solve problems of iteration.
Manipulate relations and simple functions and their inverses.
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.
Boolean Logic and Algebra
Apply the basic concepts of Boolean algebra.
Use the basic laws of Boolean algebra.
Convert Boolean expressions into a disjunctive or conjunctive normal form.
The University of Phoenix reserves the right to modify courses.
While widely available, not all programs are available in all locations or in both online and on-campus formats. Please check with a University Enrollment Advisor.
Transferability of credit is at the discretion of the receiving institution. It is the student’s responsibility to confirm whether or not credits earned at University of Phoenix will be accepted by another institution of the student’s choice.