Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Stokely, Scott W.


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

CS 208 Discrete Mathematics

Semester

S2W 2013 TI

Faculty

Stokely, Scott W.

Title

Professor

Degrees/Certificates

Masters of Science in Management
Bachelors of Science in Network Engineering

Office Location

Home

Daytime Phone

4057781568

E-Mail

Scott.Stokely@park.edu

swstokely@cox.net

swstokely@cox.net

Class Days

--T----

Class Time

4:30 - 10:20 PM

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.


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 score >= 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:

Education is a valuable commodity in life. There are many who wish they had it, and many are thankful for it. The inspiration and self-determination of an individual is a great driving force in where they will end up in life. Education is reflected in everything that people do, from driving to standing up, they are motivated to do something. A teacher is not just someone who holds a certification, but rather an individual who leads by example. A biblical perspective of this is Jesus Christ. He was not educated fully when he spoke in the synagogue, yet he still had many followers. A gifted teacher is one that can challenge a student while engaging the student with motivation for success.

Success of any student is great, but yet success in itself cannot be defined for any individual other than themselves. Students’ values, morals, and worldview guide their expectations of themselves, which all have the underlying support of motivation. My goal as a teacher is to help the students learn what drives them to be successful, what they define as success, and how success can be achieved. For some students, it is monetary gains, for others grades, and many other categories of success, however it may be the students themselves will define their own future. I believe an effective teacher is one who can distinguish how each student derives success, and helps motivate them to achieve that goal.

All students in live have the ability to learn, yet many of them choose simply to not do it. It could be that they do not see where it is benefiting them or the know how to accomplish it. In the end, students do not owe the teachers anything but for them to try for their goals. Everyone learns best in different ways, but the ultimate decision is up to them.

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:

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 Group Activity
  • Completing Tests
  • Completing a Midterm and Final Examination. This step is essential!

    Grade Distribution: 

Assessments

Number

Total Points

Percentage (%)

Group Activity

8 @ 25 200 20%

Test

4 @ 50

200

20%

Mid Term Exam

1 @ 300

300

30%

Final Exam

1 @ 300

300

30%

Total

1000

100%

Grading:

Course Grading Scale:

This subsection should list the grading scale and weighting for all of the graded work during a course. The grading scale must use the following scale below, and point totals for each letter grade must be included (see example below).

 

Letter

Cum. Points

Percentage

A

900-1000

90-100 %

B

800-899

80-89 %

C

700-799

70-79 %

D

600-699

60-69 %

F

Below 600

Below 60 %

Late Submission of Course Materials:

There will be absolutely no late work allowed, unless preapproved by the instructor prior to the absence.

Classroom Rules of Conduct:

Course Topic/Dates/Assignments:

Week Weekly Tasks
1 Chapter 1, GA 1
2 Chapter 2 and 3, GA 2, Test 1
3 Chapter 4 and 5, GA 3, Test 2
4 Chapter 6, GA 4, Midterm Exam
5 Chapter 7, GA 5 and 6
6 Chapter 8, GA 7, Test 3
7 Chapter 9 and 10, GA 8, Test 4
8 Final Exam

Week 1: Introduction to Discrete Mathematics as well as the concepts of combinatorial problems and techniques with Logic and Proof.

Week 2: Mathematical Functions, Sets, Relations and Matrix.

Week 3: Coding Theory and Graphs

Week 4: Trees and Matching 

Week 5: Midterm Exam and Network Flows and Counting Techniques

Week 6: Recurrence Relations and Generating Functions

Week 7: Combinatorial Circuits and Finite state machines

Week 8: 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 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 2012-2013 Undergraduate Catalog Page 97

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 2012-2013 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 2012-2013 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:


Bibliography:



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:2/7/2013 2:20:14 PM