Mth 221 discrete math for information technology

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

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

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 One: Combinatorics

Details

Due

Points

Objectives

1.1 Apply basic enumeration techniques.

1.2 Apply basic permutation and combination techniques.

1.3 Apply introductory probability techniques.

Reading

Read Sections 6.1 and 6.3-6.5 in Ch. 6 of Discrete Mathematics and its Applications.

Reading

Read Sections 7.1 in Ch. 7 of Discrete Mathematics and its Applications.

Video

How to Setup Connect

Watch the How to Setup Connect Video.

Video

Week One Videos

Watch the Week One Videos.

Participation

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

Discussion Questions

Respond to weekly discussion questions.

Due by Monday 11:59PM

10

Nongraded Activities and Preparation

PhoenixConnect

Follow the Math Help Community in PhoenixConnect. The focus of the community is to help students succeed in their math courses. Post questions and receive answers from other students, faculty, and staff from the Center for Mathematics Excellence.

Nongraded Activities and Preparation

Live Math Tutoring

If you need help with concepts or homework problems, join a Live Math Tutoring session by clicking the Live Math Tutoring link under Useful Links on the Materials tab of the student website.

In the session, get familiar with the whiteboard environment and the tools used in the whiteboard. Discuss any questions you may have with a tutor.

Note. Tutors can help students with homework exercises.

Individual

Week One Connect Exercises

Resource: How to Use Connect - Students

Complete the Week One Connect Exercises. There is a link to Connect on the Materials page of the student website.

Due by Monday 11:59PM

20

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

Week Five: Applications of Discrete Mathematics

Details

Due

Points

Objectives

5

5.1 Use discrete mathematics to analyze application problems.

Reading

Read Coding Theory, Food Webs, and Network Flows Case Studies for your Case Study Applications Paper.

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

Case Study Applications Paper

Choose one of the following Case Studies:

· Food Webs

· Coding Theory

· Network Flows

Write a 750- to 1,250-word paper in which you complete one of the following options:

Option 1: Food Webs Case Study

Explain the theory in your own words based on the case study and suggested readings.

Include the following in your explanation:

· Competition

· Food Webs

· Boxicity

· Trophic Status

Give an example of how this could be applied in other real-world applications.

Format your paper according to APA guidelines. All work must be properly cited and referenced.

Option 2: Coding Theory Case Study

Explain the theory in your own words based on the case study and suggested readings.

Include the following in your explanation:

· Error Detecting Codes

· Error Correcting Codes

· Hamming Distance

· Perfect Codes

· Generator Matrices

· Parity Check Matrices

· Hamming Codes

Give an example of how this could be applied in other real-world applications.

Format your paper according to APA guidelines. All work must be properly cited and referenced.

Option 3: Network Flows Case Study

Explain the solutions for examples 1, 2 and 3 from the text.

Explain the theory developed including capacitated s,t graphs and the lexicographic ordering rule based on the case study and suggested readings.

Give an example of how this could be applied in other real-world applications.

Format your paper according to APA guidelines. All work must be properly cited and referenced.

Due by Monday 11:59PM

60

Individual

Final Examination

Complete the Final Examination in Connect.

Due by Monday 11:59PM

60

Copyright

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.