Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Schnare, Katharine G.


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

F2R 2009 SC

Faculty

Schnare, Katharine G.

Title

Mathematics Instructor

Degrees/Certificates

B.A. Mathematics, Smith College
M.S. Mathematics, University of Illinois at Chicago

Office Hours

Tuesday and Thursdays 4:30 - 5:00 pm or by appointment

Daytime Phone

(808) 256-2856

E-Mail

katharine.schnare@park.edu

katharine.schnare@gmail.com

Semester Dates

October 19 - December 13

Class Days

--T-R--

Class Time

5:00 - 7:30 PM

Prerequisites

MA 131

Credit Hours

3


Textbook:
Mandatory:  (1) Discrete Mathematics, 5th Edition (November 18, 2005) by John A. Dossey, Albert D. Otto, Lawrence E. Spence, and Charles Vanden Eynden. ISBN 0321305159. Addison Wesley.


Recommended:  (2) Student's Solutions Manual to Discrete Mathematics, 5th edition, by Dossey, Otto, Spence, and Vanden Eynden. ISBN 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.

Educational Philosophy:
It is my philosophy that mathematics and computer science can best be learned through preparation, practice and interaction.

  • Preparation:  Preparation includes not only completing the assignments before class, but reading the textbook.  Students should try reading the chapters we have already addressed in class in addition to reading the material we are about to address.
  • Practice:  Homework is the most obvious and best way to practice and apply the concepts that you have learned.  Homework is a critical part of mathematics and computer science and provides an excellent opportunity for you to measure your understanding and bring concepts together.  It is also crucial to look back at previous graded homework and quizzes to understand what mistakes you made and how to correct them.  
  • Interaction:  Students are expected and encouraged to participate in class.  This includes asking questions for clarification, other approaches, applications, etc.  It also includes working with others on problems and going to the board to solve problems.  Thoughtful questions and always welcome and encouraged!

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:

Homework:  It is imperative that you do your homework.  Mathematics is a perishable skill, and you need to work with the material we have covered in the past to thoroughly learn it.   You will also be responsible for reading the textbook chapters in preparation for class, so it is easier to follow the concepts we discuss. Homework will be assigned by chapter.  The homework will be collected and graded.   The due dates are listed on the syllabus.  Homework turned in after the due date will be considered late and marked accordingly.  

Quizzes:  Quizzes will be given weekly to help you measure your understanding of the concepts we have talked about in class.  Quizzes may be closed or open book, individual or group work, in-class or take home.  At the end of the semester, only your top five quizzes will count.  Because at least one quiz will be dropped for each student, no make up quizzes will be allowed for any unexcused absence or tardiness.

Attendance:  Regular attendance and punctuality are essential for the continuity of the material.  Attendance and participation will count for part of your final grade.  If you are absent, you are still responsible for all material presented and any homework assigned.  

There will be one midterm exam given and one final exam given during this course. 

Grading:

Homework

25%

Quizzes

25%

Midterm

20%

Final

20%

Attendance

10%


Course Grading Scale:

Grade

Percentage

A

90 – 100%

B

80 – 89%

C

70 – 79%

D

60 – 69%

F

Below 60%

Late Submission of Course Materials:
Late homework assignments will be accepted, but will not be eligible for full-credit.


Make-up Exams must be coordinated prior to the date.  Make-up exams requested after the missed exam will be handled on a case-by-case basis.  

Classroom Rules of Conduct:

Class Decorum:  All students are expected to show respect to both their peers and their instructor.  Cell phones should be placed on vibrate during the class and should be used only in cases in emergency.  Texting and game playing is not allowed during class and may result in having your cell phone taken away for the duration of the lesson.  Other inappropriate behaviors include bringing/eating an abundance of food, listening to iPods, and having conversations that are not related to the material.  These behaviors may interfere with your learning and your neighbors.    

Course Topic/Dates/Assignments:

Date

Topic

Chapter

HW

Quiz/Exam

 

 

 

 

 

October 20

Introduction

1.1, 1.2

 

 

October 22

Algorithms and their efficiency

1.3, 1.4

 

Quiz 1

October 27

Sets and Equivalence

2.1, 2.2

HW 1 Due

 

October 29

Functions and Logic

2.4, A.1, A.2

 

Quiz 2

November 3

Mathematical Induction

2.5

HW 2 Due

 

November 5

Congruence

3.1, 3.2

 

Quiz 3

November 10

Graphs and Paths

4.1, 4.2

HW 3 Due

 

November 12

Shortest Paths and Coloring

4.3, 4.4

 

Quiz 4

November 17

Directed Graphs/ Review for Midterm

4.5

HW 4 Due

 

November 19

 

 

 

MIDTERM

November 24

Intro to Trees

5.1, 5.2

 

 

November 26

Thanksgiving

December 1

Trees continued

5.3

HW 5 Due

Quiz 5

December 3

Counting Techniques

8.1, 8.2, 8.3

 

 

December 8

Probability/ Review for Final

8.4, 8.5

HW 6 Due

Quiz 6

December 10

 

 

 

FINAL

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 2008-2009 Undergraduate Catalog Page 87

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 .



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:9/19/2009 5:55:41 PM