Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Allen, Ezell W.


Mission Statement: The mission of Park University, an entrepreneurial institution of learning, is to provide access to academic excellence, which will prepare learners to think critically, communicate effectively and engage in lifelong learning while serving a global community.

Vision Statement: Park University will be a renowned international leader in providing innovative educational opportunities for learners within the global society.

Course

CS 208 Discrete Mathematics

Semester

U1Y 2010 MN

Faculty

Allen, Ezell W.

Title

Adjunct Faculty

Degrees/Certificates

BS Computer Science
BS Mathematics
MS Mathematics

Office Hours

By Appointment

Daytime Phone

901-596-5868

E-Mail

ezell.allen@park.edu

ewallen@bellsouth.net

Class Days

-M-----

Class Time

5:00 - 9:40 PM

Prerequisites

MA 131 or higher level course

Credit Hours

3


Textbook:

Discrete Mathematics, 5th Ed
Dossey, Otto, Spence, and Vanden Eynden
0-321-30515-9

(Optional Purchase)
Student's Solutions Manual to Discrete Mathematics, 5th Ed
Dossey, Otto, Spence, and Vanden Eynden
0-321-30517-5, Addison Wesley

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 students 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: Any math course > MA131. 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 final exam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Link to Class Rubric

Class Assessment:

Students are required to read all assigned material prior to class. Homework will be completed prior to class and will be reviewed during class. There will be quizzes, a midterm and final exam. In additional to the assigned exercises in the text there will be hand out exercises in class.

Grading:

Final grades will be based on the following weights:

Mid Term Exam 30%
Final Exam 30%
Homework 10%
Quizzes 20%
Class Participation 10%
 

Letter gradesare assigned ( based on your overall score) as follows:

A = 90 % or above
B = 80 - 89 %
C = 70 - 79%
D = 60 - 69%
F = 59% or below

Late Submission of Course Materials:

Homework must be turned in at the beginning of class on the day it is due. The date due will be annotated at the beginning of each assignment. Late homework will be accepted at the start of the next class meeting but will incur a 20 point (out of 100) reduction in score. The instructor will accept late assignments if extenuating circumstances exist. Late homework will not be accepted after two weeks past the due date and will receive an automatic zero for the assignment. If you are going on TDY, then you are responsible to let me know.

Classroom Rules of Conduct:

Students must read all assigned chapters for that night prior to that scheduled class meeting. Students are expected to be well prepared to discuss examples and assignments provided at the end of each chapter or handed out by the instructor. Students are expected to come to all classes and be on time. Classes missed for legitimate reasons: illnesses, death in the family, work assignments, and temporary duty are excusable. The student is responsible for providing the instructor a reason for the excused absence either prior to or immediately after the absence. No talking on cell phones during the class. The student is expected not to be disruptive during the class.

Course Topic/Dates/Assignments:

Week1: 
Chapters 1: An Introduction to Combinatorial Problems and Techniques
Chapters 2: Sets, Relations, and Functions
Homework #1 is assigned

Week2:
Quiz #1
Chapter 3: Coding Theory
Chapter 4: Graphs
Homework #1 is due
Homework #2 is assigned

Week3: 
Quiz #2
Chapter 5: Trees
Homework #2 is due
Homework #3 is assigned

Week4:
Homework #3 is due
Midterm Review
Midterm Exam

Week5:
Quiz #3
Chapter 6: Matching
Chapter 7: Network Flows
Homework #4 is assigned

Week6: 
Quiz #4
Chapter 8: Counting Techniques
Chapter 9: Recurrence Relations and Generating Functions
Homework #4 is due
Homework #5 is assigned.

Week7: 
Quiz #5
Chapters 10: Combinatorial Circuits and Finite State Machines
Homework #5 is due
Homework #6 is assigned.

Week8:
Homework #6 is due
Final Exam Review
Final Exam

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 2009-2010 Undergraduate Catalog Page 92

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. Park University 2009-2010 Undergraduate Catalog Page 92

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 2009-2010 Undergraduate Catalog Page 95

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:

 



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 
Component                                                                                                                                                                                                                                                  
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:5/14/2010 3:55:29 PM