Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Windhorst, Stephanie F.


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

S1K 2011 LA

Faculty

Windhorst, Stephanie F.

Title

Adjunct Instructor

Degrees/Certificates

M. Ed. Curriculum & Instruction, Texas A&M University
B.A. Mathematics, Texas A&M University

Office Location

Laughlin Education Building

Office Hours

After class, any time via email

E-Mail

stephanie.windhorst@park.edu

Semester Dates

S1K 2011

Class Days

-M-W---

Class Time

6:00 - 8:30 PM

Prerequisites

Prerequisite: MA 131 or higher-level course

Credit Hours

3


Textbook:

(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.

(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 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. Prerequisite: A grade of C or better in any math course >= MA125, or an ACT math >= 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS score 0-45 in the College Algebra placement domain. 3:0:3

Educational Philosophy:
As an instructor, I believe my role is to facilitate the learning of the students via clear and concise lectures, relevant examples, and classroom discussion.  I believe the role of the student is to facilitate their own learning by reading the assigned text, attending lectures, completing assignments, and asking questions as soon as they arise.

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:

Assessments will be held as follows:
 
Exam 1
Week 3
Wednesday, January 26, 2011
Exam 2
Week 5
Wednesday, February 9, 2011
Exam 3
Week 7
Wednesday, February 23, 2011
Final Exam
Week 8
Wednesday, March 2, 2011


All exams will be held during class in the Laughlin Education Building.  All exams will be closed book, closed notes, closed electronic devices.

Grading:

You will be able to track your average exactly throughout the course. The grading scale is as follows: A = 90%-100%; B = 80%-90%; C = 70%-80%; D = 60%-70%; F = 0-60%. You will know in advance the standards for each assignment. My goal is to give you prompt, clear, and useful feedback to help you to succeed in this class. Each student is responsible for:
  • Completing Weekly Reading assignments (prior to class)
  • Completing Weekly Discussions (in class)
  • Completing Weekly Homework assignments 
  •  Completing a Final Examination. This step is essential!
  • Completing a Online Survey of Student Opinion of Teaching

Reading Assignments:

Students will be expected to read the assigned chapters in the textbook. The classroom discussions, class lectures, assigned homework, and all exams will assume you have read the assigned material.

Homework
 
Homework will be due at the beginning of class each Wednesday unless otherwise stated.  Only a sampling of problems will be graded, so it is important that all problems are done.  There will be six (6) homework assignments throughout the course.  The lowest homework grade will be dropped.  There will be 100 points for the total homework grade, each assignment will be worth 20 points.

Grade Distribution:

Assessments

Points per Week

 Number of Weeks

Points Total

Percentage

Homework

20

5

100

16.66%

Exam 1

100

1

100

16.66%

Exam 2

100

1

100

16.66%

Exam 3

100

1

100

16.66%

Final Exam

200

1

200

33.33%

Percentage Total

100%

 

Course Grading Scale:

There will be a total of 600 points.  Grades will be distributed as follows: 

Letter

Points

Percentage

A

540-600 

90-100 %

B

480-539

80-89 %

C

420-479 

70-79 %

D

360-419 

60-69 %

F

359 and below

Below 60 %

Late Submission of Course Materials:

Late assignments will not be accepted without prior approval of the instructor.

Classroom Rules of Conduct:

Students are expected to arrive to class on time and prepared.  Students are expected to participate in class and seek assistance from the instructor when necessary.  Students are expected to be respectful of the instructor and other students. 

Course Topic/Dates/Assignments:

Topics covered in class are as follows:

Week   

Dates

Topics

Chapter

Assignments

1

Jan. 10 and 12

Logic, Indroduction to Combinatorial Problems & Techniques 

Appendix A, Chp. 1 

Homework 1 (due Jan. 19)

2

Jan. 17 and 19 

Introduction to Combinatorial Problems & Techniques (cont), Sets, Relations, & Functions

Chp. 1, Chp. 2 

Homework 2 (due Jan. 26)

3*

Jan. 24 and 26

Sets, Relations, & Functions

Chp. 2

Homework 3 (due Feb. 2)

4

Jan. 31 and Feb. 2

Graphs, Trees

Chp. 4, Chp. 5

Homework 4 (due Feb. 9)

5*

Feb. 7 and 9

Recurrence Relations & Generating Functions

Chp. 9

Homework 5 (due Feb. 16)

6

Feb. 14 and 16

Counting Techniques

Chp. 8

Homework 6 (due Feb. 23)

7*

Feb. 21 and 23

Matrices & Coding Theory

Appendix B, Chp. 3

No homework assigned

8

Feb. 28 and Mar. 2

Review for Final Exam

all material covered in class

No homework assigned

*Exams will be given on the Wednesday of class during weeks 3, 5, and 7.

Note:  This syllabus is a guide to pace and content.  Further, not all of the material in each chapter will be covered.

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

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

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:12/12/2010 5:27:14 PM