Syllabus Entrance
Printer Friendly
Email Syllabus

MA 208 Discrete Mathematics
Wakeman, Jeremy


Mission Statement: Park University provides access to a quality higher education experience that prepares a diverse community of learners to think critically, communicate effectively, demonstrate a global perspective and engage in lifelong learning and service to others.

Vision Statement: Park University, a pioneering institution of higher learning since 1875, will provide leadership in quality, innovative education for a diversity of learners who will excel in their professional and personal service to the global community.

Course

MA 208 Discrete Mathematics

Semester

FA 2012 HO

Faculty

Wakeman, Jeremy

Title

Visiting Assistant Professor of Computer Science

Degrees/Certificates

MBA Northwest Missouri State University
BS Mathematics / Computer Information Systems Lincoln University

Office Location

SC 209C

Office Hours

T-R 7:45-8:45AM; 10:00-11:30AM; and T 5:00PM-6:00PM

E-Mail

Jeremy.Wakeman@park.edu

Semester Dates

August 20, 2012 - December 14, 2012

Class Days

--T-R--

Class Time

8:45 - 10:00 AM

Prerequisites

A grade of C or better in any math course >= MA125, or an ACT math score >= 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS score 0-45

Credit Hours

3


Textbook:
Discrete Mathematics; by Dossey, Otto, Spence, Vanden Eynden, Pearson/Addison-Wesley Publisher, 5th Edition, 2006©
ISBN: 0321305159

Textbooks can be purchased through the MBS bookstore

Textbooks can be purchased through the Parkville Bookstore

Additional Resources:

McAfee Memorial Library - Online information, links, electronic databases and the Online catalog. Contact the library for further assistance via email or at 800-270-4347.
Career Counseling - The Career Development Center (CDC) provides services for all stages of career development.  The mission of the CDC is to provide the career planning tools to ensure a lifetime of career success.
Park Helpdesk - If you have forgotten your OPEN ID or Password, or need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.


Course Description:
CS208 Discrete Mathematics: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. Prequisite: A grade of "C" or better in any math course >= than MA125, or an ACT math score >= than 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS sc ore 0-45 in the College Algebra placement domain. 3:0:3

Learning Outcomes:
  Core Learning Outcomes

  1. Explain and solve problems involving logics, Boolean algebra, combinatorial circuits, sets, relations, and functions, proofs, mathematical induction, and recurrence relations.
  2. Explain and solve problems involving graphs, paths, circuits, graph coloring, directed graphs, shortest path algorithms.
  3. Explain and solve problems involving trees, spanning trees, rooted trees, binary trees, and tree traversal algorithms.
  4. Explain and solve problems involving counting techniques such as permutations, combinations, binomial theorem, and probability.


Core Assessment:
For this course, the assessment is based on a final exam. There will be 4 questions in each of the 8 categories, i.e.Synthesis, Analysis,… etc. Thus, there will be 32 questions total in the finalexam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Link to Class Rubric

Class Assessment:

Grades are determined from homework, and exams. For homework use a separate wire-bound notebook. Use this notebook only for homework and then a separate one for taking notes. Below is the initial schedule for tests and the final and could change due to days off due to weather.

1.       Homework – Will be completed in a separate notebook and will be turned in on the day of each of the tests for grading, and will be worth 30 points each time it is turned in for a total of 150 points.

2.       Exams – Will be almost every 3 weeks and cover 2 chapters of material (as noted in the table below). Each exam will be worth 150 points, 5 exams total, dropping the lowest score for a total of 600 points.

3.       Final Exam – Will be a comprehensive exam worth 250 points.

NOTE 1: Calculators cannot be used on ANY test.

NOTE 2: There are NO MAKEUP exams given. If you are participating in university activities such as playing sports for the university then please arrange a time that you may take the exam before the scheduled date of the exam.

Grading:

Grades Per Assignment

Deliverable

Qty

Points

Homework Notebooks

5 / 30 Points Each

150 Points

Section Exams

5 / 150 Points Each – Lowest Score

600 Points

Final Exam

250 Points

250 Points

 

 Final Grades

 A = 100% - 90% {Points 1000 - 900 }

 B = 89.9% - 80% {Points 899 - 800}

 C = 79.9% - 70% {Points 799 - 700}

 D = 69.9% - 60% {Points 699 - 600}

 F = 59.9% and Below {Less than 599 points}

Late Submission of Course Materials:

Assignments not submitted on the due date will receive a grade of “zero.”

Classroom Rules of Conduct:

All students are expected to be present and on time for each class and no TEXTING in class. It is expected that each student come to class prepared to take notes and to turn in homework on test dates.  

Course Topic/Dates/Assignments:

Class Schedule

Week 1

21-Aug

23-Aug


Introductions, Review Syllabus and Expectations, Section 1.1

Sections 1.2 & 1.3

Week 2

28-Aug

30-Aug


Sections 1.4 & 2.1

Sections 2.2 & 2.4

Week 3

4-Sep

6-Sep


Sections 2.5, 2.6 & Review

Exam 1 & Homework Notebooks Due

Week 4

11-Sep

13-Sep


Sections 3.1 & 3.2

Sections 3.3 & 3.4

Week 5

18-Sep

20-Sep


APPENDIX B, Sections 3.5 & 3.6

Sections 4.1 & 4.2

Week 6

25-Sep

27-Sep


Sections 4.3, 4.4, 4.5 & Review

Exam 2 & Homework Notebooks Due

Week 7

2-Oct

4-Oct


Sections 5.1, 5.2 & 5.3

Sections 5.4, 5.5 & 5.6

Week 8

9-Oct

11-Oct


Sections 5.6, 6.1 & 6.2

Sections 6.2, 6.3 & 6.4

Week 9

16-Oct

18-Oct


Fall Break

Fall Break

Week 10

23-Oct

25-Oct


Section 6.5 & Chp 5 & 6 Review

Exam 3 & Homework Notebooks Due

Week 11

30-Oct

1-Nov


Sections 7.1 & 7.2

Sections 7.3 & 7.4

Week 12

6-Nov

8-Nov


Sections 8.1 & 8.2

Sections 8.3 & 8.4

Week 13

13-Nov

15-Nov


Sections 8.5, 9.1 & Review Chp 7 & 8

Exam 4 & Homework Notebooks Due

Week 14

20-Nov

22-Nov


Sections 9.2, 9.3 & 9.5

Thanksgiving Holiday (No Class)

Week 15

27-Nov

29-Nov


Sections 9.6, 10.1 & 10.2

Sections 10.3, 10.4 & Review

Week 16

4-Dec

6-Dec


Exam 5 & Homework Notebooks Due

Class Review and Final Exam Prep

Week 17

11-Dec

13-Dec


No Class

8-10 Final Exam


Homework Schedule

Topics

Section

Problems

Time to Complete a Project

1.1

# 1-15 Odd

A Matching Problem

1.2

# 1-25 Odd

A Knapsack Problem

1.3

# 1-25 Odd

Algorithms and Their Efficiency

1.4

# 1-25 Odd

Set Operations

2.1

# 1-12, 17-24, 33,35,37

Equivalence Relations

2.2

# 1-27 Odd

Functions

2.4

# 1-63 Odd

Mathematical Induction

2.5

# 7-25 Odd

Applications

2.6

# 1-39 Odd

Congruence

3.1

# 1-37 Odd

The Euclidean Algorithm

3.2

# 1-25 Odd

The RSA Method

3.3

# 1-25 Odd

Error-Detecting and Error-Correcting Codes

3.4

# 1-39 Odd

APPENDIX B: Matrices

B.1

# 1-25 Odd

Matrix Codes

3.5

# 1-41 Odd

Matrix Codes that Correct All Single-Digit Errors

3.6

# 1-37 Odd

Graphs and Representations

4.1

# 1-47 Odd

Paths and Circuits

4.2

# 1-59 Odd

Shortest Paths and Distance

4.3

# 1-15 Odd

Factoring Trinomials

4.4

# 1-21 Odd & 29

Directed Graphs and Multigraphs

4.5

# 1-69 Odd

Properties of Trees

5.1

# 1-31 Odd

Spanning Trees

5.2

# 1-19 Odd

Depth-First Search

5.3

# 1-27 Odd

Rooted Trees

5.4

# 1-23 Odd

Binary Trees and Traversals

5.5

# 1-49 Odd

Optimal Binary Trees and Binary Search Trees

5.6

# 1-33 Odd

Systems of Distinct Representatives

6.1

# 1-19 Odd

Matchings in Graphs

6.2

# 1-15 Odd

A Matching Algorithm

6.3

# 1-21 Odd

Applications of the Algorithm

6.4

# 1-13 Odd & 14

The Hungarian Method

6.5

# 1-15 Odd

Flows and Cuts

7.1

# 1-29 Odd

A Flow Augmentation Algorithm

7.2

# 1-27 Odd

The Max-Flow Min-Cut Theorem

7.3

# 1-23 Odd

Flows and Matchings

7.4

# 1-23 Odd

Pascals Triangle and the Binomial Theorem

8.1

# 1-27 Odd

Three Fundamental Principles

8.2

# 1-33 Odd

Permutations and Combinations

8.3

# 1-29 Odd

Arrangements and Selections with Repetitions

8.4

# 1-29 Odd

Probability

8.5

# 1-35 Odd

Recurrence Relations

9.1

# 1-37 Odd

The Method of Iteration

9.2

# 1-25 Odd

Linear Difference Equations with Constant Coefficients

9.3

# 1-29 Odd

Counting with Generating Functions

9.5

# 1-31 Odd

The Algebra of Generating Functions

9.6

# 1-31 Odd

Logical Gates

10.1

# 1-41 Odd

Creating Combinatorial Circuits

10.2

# 1-35 Odd

Karnaugh Maps

10.3

# 1-35 Odd

Finite State Machines

10.4

# 1-33 Odd





Academic Honesty:
Academic integrity is the foundation of the academic community. Because each student has the primary responsibility for being academically honest, students are advised to read and understand all sections of this policy relating to standards of conduct and academic life. Park University students and faculty members are encouraged to take advantage of the University resources available for learning about academic honesty (www.park.edu/current or http://www.park.edu/faculty/).from Park University 2011-2012 Undergraduate Catalog Page 95-96

Plagiarism:
Plagiarism involves the use of quotations without quotation marks, the use of quotations without indication of the source, the use of another's idea without acknowledging the source, the submission of a paper, laboratory report, project, or class assignment (any portion of such) prepared by another person, or incorrect paraphrasing. from Park University 2011-2012 Undergraduate Catalog Page 95

Attendance Policy:
Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  3. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "F".
  4. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  5. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  6. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2011-2012 Undergraduate Catalog Page 98

Disability Guidelines:
Park University is committed to meeting the needs of all students that meet the criteria for special assistance. These guidelines are designed to supply directions to students concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the Americans with Disabilities Act of 1990, regarding students with disabilities. In the case of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Additional information concerning Park University's policies and procedures related to disability can be found on the Park University web page: http://www.park.edu/disability .

Additional Information:

Important Dates


August 20, 2012 First day of
class


August 27, 2012 Last day to
drop


October 14 – 21, 2012 Fall
Break


November 02, 2012 Last day to
withdraw


December 14, 2012 Last day of
finals



Rubric

CompetencyExceeds Expectation (3)Meets Expectation (2)Does Not Meet Expectation (1)No Evidence (0)
Synthesis                                                                                                                                                                                                                                                  
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Analysis                                                                                                                                                                                                                                                   
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Evaluation                                                                                                                                                                                                                                                 
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Terminology                                                                                                                                                                                                                                                
Outcomes
1,2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Concepts                                                                                                                                                                                                                                                   
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Application                                                                                                                                                                                                                                                
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Whole Artifact                                                                                                                                                                                                                                             
Outcomes
1,2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 

Copyright:

This material is protected by copyright
                               and can not be reused without author permission.

Last Updated:8/20/2012 8:54:15 AM