Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Tonsmann, Guillermo


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

F2A 2012 BEX

Faculty

Tonsmann, Guillermo

Title

Associate Professor of Computer Science

Degrees/Certificates

Ph.D. Computer Science, Louisiana State University (Baton Rouge, Louisiana)
Honors B.S. Computer Science, University of South Africa (Pretoria, South Africa)
M.Eng. in Chemical Engineering, Potchefstroom University (Potchefstroom, South Africa)

Office Location

Austin Campus - Room 109

Office Hours

Mondays and Wednesdays from 3:00pm to 4:45pm, and at other times by appointment.

Daytime Phone

(512) 385-7275 ext 5709

E-Mail

tonsmann@park.edu

Semester Dates

Monday, October 22, 2012 through Sunday, December 16, 2012

Class Days

-M-W---

Class Time

5:10 - 7:50 PM

Prerequisites

Grade C or better in any Math greater than or equal to MA125

Credit Hours

3


Textbook:
Dossey, J., Discrete Mathematics, 5th Edition, Addison-Wesley, 2005, ISBN 0-321-30515-9.

Textbooks can be purchased through the MBS bookstore

Additional Resources:
Access to a computer with a headset with microphone and speakers, and a webcam are required for each student at all class sessions. The student must be able to communicate with the class session and the instructor through these devices.
A scientific calculator may be handy, but not necessary.

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:
Is the instructor belief, that mathematical concepts are better learned by their use on the solution of relevant problems. After the instructor presents the main concepts and principles of the topics at hand, with the use of mathematical notation, a number of problems and their solutions will be solved in class with the students. Later on, students will engage in class on the solution of similar problems for the reinforcement of the material exposed, under the guidance of the instructor. Assignments will be designed to further emphasize these concepts. Quizzes and examinations will test the degree of learning of every student.  

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 expected to:
A. Complete the reading assignments, as indicated in the Class Schedule, before class.
B. Attend all class sessions on time and participate actively in the solution of problems presented during class-time.
C. Complete all quizzes when scheduled. There will be five quizzes during the semester.
D. Complete all homework/assignments when scheduled. There will be six graded assignments.
E. Complete the midterm and final examinations when scheduled.

Grading:
Quizzes (5, first 3 worth 4% each and last 2 worth 8% each)                                      28% 
Homework/Assignments (6, first 4 worth 3% each and last 2 worth 4% each)            20%
Midterm Exam (online)                                                                                              17%
Final Exam                                                                                                                35%

Grade Scale:
A = 100 –90
B =  89 –80
C =  79 –70
D =  69 –60
F = below 60

Late Submission of Course Materials:
Homework is due at the beginning of class on the stated due-date.
Late homework may not be accepted, because its solution will be discussed during class time on due date.

Quizzes and the midterm exam will be available online for students in eCompanion only during the week in which they are scheduled. Students may only take them during that week at a time they deem convenient. Quizzes will cover the topics discussed in the previous week.

There will be no “make-up” homework or quizzes, or additional homework to replace grades. Please do not insist.

Classroom Rules of Conduct:
LAST DAY TO DROP:  Monday, October 29, 2012
LAST DAY TO WITHDRAW:  Sunday, November 25, 2012
INCOMPLETE GRADE:  As a rule, incomplete grades will not be given.  Exceptions to the rule do exist, however, like a prolonged hospitalization and/or traumatic death in the family. In these cases, the student may be allowed to petition for an incomplete.  The instructor retains the right to veto any such petition, or grant an incomplete in other unforeseen circumstances.
WITHDRAW:  The enrollment status of the student in this course is solely the responsibility of the student. If a student wishes to withdraw from this course, s/he must file the appropriate paperwork with the registrar before the appropriate deadlines. Every student is considered enrolled unless s/he is officially withdrawn.


Other Rules

1. Students are required to attend and actively participate in all class sessions. This is particularly important in this course where synchronous interaction at a distance is being initialized tested for classes at Park University.

2. Class sessions will be held under a synchronous environment, Blackboard Collaborate. Students will receive an Internet link to the class session that they must use to connect for classes and office hours.

3. Students must secure a working computer with headset (with microphone and speakers) and a webcam for all class sessions. Use of separate microphone and speakers is discouraged to avoid echo effects in the line. Students should connect 10 minutes before the beginning of every session to setup audio and video.
4. Students must check their account for this course on eCompanion (www.parkonline.org) and their Park email regularly. Class announcements and class materials will be distributed using one or both services. Gradebook and drop boxes for assignments will also be located in eCompanion.

5. All interested and/or registered students must attend an Information Session (held at various times before the semester begins) to be enrolled definitely in the class. Students may approach their CCDs or the Instructor for dates and times of these sessions.

6. All students must also attend the Introductory Session for the course the week before the beginning of the Semester, Wednesday October 17, 2012 at 5:10pm CST.

Course Topic/Dates/Assignments:
Class schedule and activities may change at the instructor's discretion to pace students' learning.
 

Session

Class Activities

Required Reading before Session

Homework Given

Homework Due Date

Online Quizzes & Exams (By end of the Week)

Monday Oct. 22, 2012

Intro to the course.
Logic and Logic Laws.

Sections A.1 and A.2 in Appendix A from textbook. Also, leisurely read Chapter 1 as an introduction to the problems in Discrete Mathematics.

Wednesday Oct. 24, 2012

Logic Laws (end)

Sections A.1 and A.2 in Appendix A from textbook. Also, leisurely read Chapter 1 as an introduction to the problems in Discrete Mathematics.

HWK 1

Monday Oct. 29, 2012

Review of Homework 1.
Logical Circuits.
Introduction to Proof and Mathematical Induction (begin).

Sections 10.1-10.2 in Chapter 10 and Section A.3 in Appendix A from textbook.

HWK 1
3% of the grade

Quiz 1 – Logic
(1/2 hour)
4% of the grade

Wednesday Oct. 31, 2012

Mathematical Induction.

Section A.3 in Appendix A.

HWK 2

Monday Nov. 5, 2012

Review of Homework 2.
Set Definitions (begin).

Chapter 2 from textbook.

HWK 2
3% of the grade

Quiz 2 – Combinatorial Circuits, Proof and Mathematical Induction.
(1/2 hour)
4% of the grade

Wednesday Nov.7, 2012

Set Operations (end).

Chapter 2 from textbook.

HWK 3

Monday Nov. 12, 2012

Review of Homework 3.
Relations

Chapter 2 from textbook.

HWK 3
3% of the grade

Quiz 3 – Set Theory
(1/2 hour)
4% of the grade

Wednesday Nov. 14, 2012

Functions

Chapter 2 from textbook.

HWK 4

Monday Nov. 19, 2012

Review of Homework 4. & Midterm Exam material.
Graphs

Chapters 4 from textbook.

HWK 4
3% of the grade

Midterm Exam (Logic, Proof, Combinatorial Circuits, Sets, Set Operations, Relations and Functions – 1.5 hour)
17% of the grade

Wednesday Nov. 21, 2012

No class – Thanksgiving Holiday.

Monday Nov. 26, 2012

Graphs.

Chapter 4 from textbook.

Quiz 4 – Graphs
(1 hour)
8% of the grade

Wednesday Nov. 28, 2012

Review of Homework 5.
Graphs.

Chapter 4 from textbook.

HWK 5

Monday Dec. 3, 2012

Trees.

Chapter 5 from textbook.

HWK 5
4% of the grade

Quiz 5 – Trees
(1 hour)
8% of the grade

Wednesday Dec 5, 2012

Review of Homework 6.
Trees.

Chapter 5 from textbook.

HWK 6

Monday Dec. 10, 2012

Trees. – Final
Review of Homework 7.

Final course review.

Chapter 5 from textbook.

HWK 6
4% of the grade

Wednesday Dec. 12, 2012

No class – Proctored Final Exam at Proctoring Center (Comprehensive – 2hours).
35% of the grade

Chapters 2, 4, 5, 10.1, 10.2 and Appendix A from textbook for Final Exam.

Grade Totals

Final Exam = 35%

 

HWKs = 20%

45% = 17%Midterm + 28% Quizzes

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 .



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/10/2012 4:14:09 PM