Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Tonsmann, Guillermo


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

S1A 2011 BE

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 5:00pm, and at other times by appointment.

Daytime Phone

(512) 385-7275 ext 209

E-Mail

tonsmann@park.edu

Web Page

http://kidd.park.edu/tonsmann

Semester Dates

Monday, January 10, 2011 through Sunday, March 6, 2011

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:
A scientific calculator may be handy, but not necessary at all during class time.

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:
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 before class as indicated in the Class Schedule.
B. 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. Relative weights on assignments may be indicated in each of these instances.
E. Complete the midterm and final examinations when scheduled.

Grading:

Grading:
Quizzes (5)                                                                        20% 
Homework/Assignments (6)                                             20%
Midterm Exam                                                                  30%
Final Exam                                                                        30%

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 be accepted, if
 (1) such arrangement is previously established with the instructor (it is the responsibility of the student to make these arrangements in time) and
 (2) evidence of progress is demonstrated on the due date.
Late assignments may carry penalties at the instructor discretion.

Quizzes will be administered during the class session on the designated dates. They will cover the topics discussed in the previous class. There will be no “make-up” quizzes.

Classroom Rules of Conduct:

LAST DAY TO DROP:  Monday, January 17, 2011
LAST DAY TO WITHDRAW:  Sunday, February 13, 2011

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 should disconnect or set to silent any cellular phones or beeping devices during class sessions.
2. Students should refrain from disruptive behavior during class sessions.
3. Students must check their account on www.parkonline.org and their Park email regularly. Class announcements and class materials will be distributed using one or both services.

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

Monday Jan. 10, 2011

Intro to the course.
Logic and Logic Rules.

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 Jan. 12, 2011

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

Homework 1

Monday Jan. 17, 2011

Review of Homework 1.
Combinatorial 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.

Homework 1

Wednesday Jan. 19, 2011

Quiz 1.
Introduction to Proof and Mathematical Induction.(end)
Sets (begin).

Section A.3 in Appendix A and Chapter 2 from textbook.

Homework 2

Monday Jan. 24, 2011

Review of Homework 2.
Set Operations and Relations (begin).

Chapter 2 from textbook.

Homework 2

Wednesday Jan. 26, 2011

Quiz 2.
Set Operations and Relations (end).
Functions (begin).

Chapter 2 from textbook.

Homework 3

Monday Jan. 31, 2011

Review of Homework 3.
Functions (end)

Chapter 2 from textbook.

Homework 3

Wednesday Feb. 2, 2011

Quiz 3.
Graphs.

Chapter 4 from textbook.

Monday Feb. 7, 2011

Midterm Exam (Logic, Proof, Combinatorial Circuits, Sets, Set Operations, Relations and Functions).

Chapters 2, Sections 10.1-10.2 in Chapter 10 and Appendix A from textbook for the Midterm Exam.

Wednesday Feb. 9, 2011

Graphs (end).

Chapter 4 from textbook.

Homework 4

Monday Feb. 14, 2011

Review of Homework 4.
Trees.

Chapter 5 from textbook.

Homework 4

Wednesday Feb. 16, 2011

Quiz 4.
Trees (continued).

Chapter 5 from textbook.

Homework 5

Monday Feb. 21, 2011

Review of Homework 5.
Trees (end).

Chapter 5 from textbook.

Homework 5

Wednesday Feb. 23, 2011

Quiz 5.
Counting Techniques. Combinations and permutations without repetitions.

Chapter 8 from textbook.

Homework 6

Monday Feb. 28, 2011

Review of Homework 6.
Counting Techniques. Combinations and permutations with repetitions.
Final course review.

Chapter 8 from textbook.

Homework 6

Wednesday Mar. 2, 2011

Final Exam (Graphs, Trees, & Counting Techniques).

Chapters 4, 5, and 8 from textbook for 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 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 .



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:11/17/2010 4:29:03 PM