[ Skip Main Nav ]

University of Phoenix

http://www.phoenix.edu

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. To enroll, speak with an Enrollment Advisor.
  • Boolean Logic and Algebra

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

    • Apply properties of general graphs.
    • Identify properties of a tree.
    • Identify graph isomorphisms, planarities, connected components, and chromatic numbers.
  • Relations & Functions Part 2 & More Enumeration

    • Use the Principle of Inclusion and Exclusion.
    • Apply the properties of equivalence relations and partitions.
    • Use the properties of relations.
  • Algorithmic Concepts, Relations & Functions Part 1

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

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

We're here to help

  • Request more information
  • Live Chat
  •  

Learn more today

Loading...
©2006-2011 University of Phoenix, Inc. All rights reserved.