In: Computers and Technology

Submitted By DrmmrTNT
Words 1891
Pages 8
|[pic] |Syllabus |
| |College of Information Systems & Technology |
| |MTH/221 Version 1 |
| |Discrete Math for Information Technology |

Copyright © 2010 by University of Phoenix. All rights reserved.

Course Description

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.


Faculty and students/learners will be held responsible for understanding and adhering to all policies contained within the following two documents:

• University policies: You must be logged into the student website to view this document. • Instructor policies: This document is posted in the Course Materials forum.

University policies are subject to change. Be sure to read the policies at the beginning of each class. Policies may be slightly different depending on the modality in which you attend class. If you have recently changed modalities, read the policies governing your current class modality.

Course Materials

Grimaldi, R. P. (2004). Discrete and combinatorial mathematics: An applied introduction. (5th ed.). Boston, MA: Pearson Addison Wesley.


Similar Documents

HD Down for the Count (2009) | Amazing Nature Wallpapers {Pack-149} | Smallfoot