# MTH/221 Discrete Math For Information Technology UOP Course Assistance

MTH/221 Discrete Math For Information Technology UOP Course Assistance. ANY VERSION IS ACCEPTABLE

Course Design Guide

College of Humanities and Sciences

MTH/221 Version 2

Discrete Math for Information Technology

Course Description

Discrete mathematics is of direct importance to the fields of Computer Science and Information Technology. This branch of mathematics includes studying areas such as sophisticated forms of counting (combinatorics, etc.), 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.

Policies

Faculty and students 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

Rosen, K. H. (2012). Discrete mathematics and its applications. (7th ed.). New York, NY: McGraw-Hill.

All electronic materials are available on the student website.

 Assignment Breakdown Week One Individual Assignment: Week One Connect Exercises 20 Week Two Individual Assignment: Week Two Connect Exercises 20 Week Three Individual Assignment: Week Three Connect Exercises 20 Week Four Individual Assignment: Week Four Connect Exercises 20 Week Five Individual Assignment: Case Study Applications Paper 60 Individual Assignment: Final Examination 60 All Weeks Discussion Questions 50 Participation 50 Point Total 300

 Week Two: Logic & Set Theory; Boolean Algebra; Relations & Functions Details Due Points Objectives 2  2.1  Use truth tables for propositional logic. 2.2  Simplify assertions and compound statements in first-order logic. 2.3  Apply basic set-theoretic concepts. 2.4  Use a Venn Diagram to visualize set relationships. 2.5  Differentiate between relations and functions. 2.6  Apply the basic concepts of Boolean algebra. Reading Read Sections 1.1–1.3 in Ch. 1 of Discrete Mathematics and its Applications. Reading Read Sections 2.1–2.3 in Ch. 2 of Discrete Mathematics and its Applications. Reading Read Section 9.1 in Ch. 9 of Discrete Mathematics and its Applications. Reading Read Sections 12.1–12.3 in Ch. 12 of Discrete Mathematics and its Applications. Video Week Two Videos Watch the Week Two Videos. Participation Participate in class discussion. Due by Monday 11:59PM 10 Discussion Questions Discussion Questions: Two DQ’s will be posted in the main classroom. Respond to each of the discussion questions a minimum of four times. Be sure to use substantive responses. See Instructor Policies and assignments for more details. Due by Monday 11:59PM 10 Individual Week Two Connect Exercises Complete the Week Two Connect Exercises. Due by Monday 11:59PM 20

 Week Three: Algorithmic Concepts Details Due Points Objectives 3  3.1  Apply the basic concepts of algorithmic analysis. 3.2  Apply the introductory principles of mathematical induction. 3.3  Solve problems of iteration and recursion. Reading Read Ch. 3 of Discrete Mathematics and its Applications. Reading Read Section 5.1 in Ch. 5 of Discrete Mathematics and its Applications. Reading Read the Introduction and Recursively Defined Function in Section 5.3 in Ch. 5 of Discrete Mathematics and its Applications. Reading Read Section 5.4 in Ch. 5 of Discrete Mathematics and its Applications. Video Week Three Videos Watch Week Three Videos. Participation Participate in class discussion. Due by Monday 11:59PM 10 Discussion Questions Discussion Questions: Two DQ’s will be posted in the main classroom. Respond to each of the discussion questions a minimum of four times. Be sure to use substantive responses. See Instructor Policies and assignments for more details. Due by Monday 11:59PM 10 Individual Week Three Connect Exercises Complete the Week Three Connect Exercises. Due by Monday 11:59PM 20

 Week Four: Graph Theory and Trees Details Due Points Objectives 4  4.1  Apply properties of graphs. 4.2  Apply properties of trees. Reading Read Sections 10.1–10.6 in Ch. 10 of Discrete Mathematics and its Applications. Reading Read Sections 11.1–11.3 in Ch. 11 of Discrete Mathematics and its Applications. Video Week Four Videos Watchthe Week Four Videos. Participation Participate in class discussion. Due by Monday 11:59PM 10 Discussion Questions Discussion Questions: Two DQ’s will be posted in the main classroom. Respond to each of the discussion questions a minimum of four times. Be sure to use substantive responses. See Instructor Policies and assignments for more details. Due by Monday 11:59PM 10 Individual Week Four Connect Exercises Complete the Week Four Connect Exercises. Due by Monday 11:59PM 20

University of Phoenix® is a registered trademark of Apollo Group, Inc. in the United States and/or other countries.

Microsoft®, PowerPoint®, Windows®, and Windows NT® are registered trademarks of Microsoft Corporation in the United States and/or other countries. All other company and product names are trademarks or registered trademarks of their respective companies. Use of these marks is not intended to imply endorsement, sponsorship, or affiliation.

Edited in accordance with University of Phoenix® editorial standards and practices.

MTH/221 Discrete Math For Information Technology UOP Course Assistance

## Why US?

##### 100% Confidentiality

Information about customers is confidential and never disclosed to third parties.

##### Timely Delivery

No missed deadlines – 97% of assignments are completed in time.

##### Original Writing

We complete all papers from scratch. You can get a plagiarism report.

##### Money Back

If you are convinced that our writer has not followed your requirements, feel free to ask for a refund.