CS 208 Discrete Mathematics
S2T 2010 DLA
Green, Kathleen R.
PhD - Adult EducationMBA - Business AdministrationBA - Chemistry
See the "Office" Tab on the Course Home Page
9am - 5pm Mountain Time
15 March - 09 May 2010 (S2T 2010 DLA)
(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
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 email@example.com or call 800-927-3024Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.Advising - Park University would like to assist you in achieving your educational goals. Please contact your Campus Center for advising or enrollment adjustment information.Online Classroom Technical Support - For technical assistance with the Online classroom, email firstname.lastname@example.org or call the helpdesk at 866-301-PARK (7275). To see the technical requirements for Online courses, please visit the http://parkonline.org website, and click on the "Technical Requirements" link, and click on "BROWSER Test" to see if your system is ready.FAQ's for Online Students - You might find the answer to your questions here.
Educational Philosophy: My educational philosophy is one of inter-activeness based on lectures, readings, dialogues, examinations, internet, videos, web sites and writings. I will engage each student to encourage the lively exploration of ideas, issues, and contradictions. School should be fun not a chore. Anyone who works at it with diligence and courage can learn to think more clearly, accurately, and efficiently and express ideas with clarity and poise.
Learning Outcomes: Core Learning Outcomes
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 RubricClass Assessment: Reading Assignments:
· Students will be expected to read the assigned chapters in the textbook and the lectures.
· The Online/Class Discussions, Homework Assignments, Self Checks, Quizzes and Final Examination assume you have read the assigned readings.
Class Participation (Online/Class Discussions):
· Students should visit the discussion area at least three times each week or a minimum three hours per week, or participate at class. Making sure that you post your discussion in the proper format, is of great importance. We will post as:
PROBLEM: Section # [student will post, at a minimum, one problem]
· There is no credit given if a student does not participate in the Class Discussion during the week assigned or does not post in the correct manner as stated above.
Homework Assignments & Quizzes:
Points earned each week
Number of Weeks
Course Home Introduction
Weekly Self Checks
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).
Below 60 %
Late Submission of Course Materials:
Classroom Rules of Conduct: On-Line Participation
Chapter 1 – AN INTRODUCTION TO COMBINATORIAL PROBLEMS AND TECHNIQUES
Section 1.1 – The Time to Complete a Project
Section 1.2 – A Matching Problem
Section 1.3 – A Knapsack Problem
Chapter 2 – SETS, RELATIONS, AND FUNCTIONS
Section 2.1 – Set Operations
Chapter 2 - SETS, RELATIONS, AND FUNCTIONS
Section 2.4 – Functions
Section 2.5 – Mathematical Induction
Appendix A Section A.1 – STATEMENTS AND CONNECTIVES
Appendix A Section A.2 – LOGICAL EQUIVALENCE
Chapter 9 – RECURRENCE RELATIONS AND GENERATING FUNCTIONS
Section 9.1 – Recurrence Relations
Section 9.2 – The Method of Iteration
Section 1.4 – Algorithms and Their Efficiency
Chapter 10 – COMBINATORIAL CIRCUITS AND FINITE STATE MACHINES
Section 10.1 – Logical Gates
Section 10.2 – Creating Combinatorial Circuits
Section 10.3 – Karnaugh Maps
· Operate and practice binary data representation, binary to decimal conversion, decimal to binary conversion, binary addition (Not in the textbook, See Supplemental Material)
Chapter 4 – GRAPHS
Section 4.1 – Graphs and Their Representations
Section 4.2 – Paths and Circuits
Section 4.3 – Shortest Paths and Distance
Section 4.4 – Coloring a Graph
Section 4.5 – Directed Graphs and Multigraphs
Chapter 5 – TREES
Section 5.1 – Properties of Trees
Section 5.2 – Spanning Trees
Section 5.3 – Depth-First Search
Section 5.4 – Rooted Trees
Section 5.5 – Binary Trees and Traversals
Week 7: Chapter 8 – COUNTING TECHNIQUES
Section 8.1 – Pascal’s Triangle and the Binomial Theorem
Section 8.2 – Three Fundamental Principles
Section 8.3 – Permutations and Combinations
Section 8.4 – Arrangements and Selections with Repetitions
Section 8.5 – Probability
Week 8: Review and 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 2009-2010 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. 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.
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 .
Bibliography: I began teaching and tutoring for Park University at the Mountain Home AFB, Idaho Campus in 1993. Until April 31, 2005, I was also the Testing Center Supervisor for LaserGrade Computerized Testing (Yes, one of those "official" proctors). I watched the Park University Online Program grow from a handful of instructors and students to its present day size. As an online instructor I have been required to take several online instructional courses, and have also received my PhD in Adult Education, specializing in Online/Distant Learning. I have developed many courses in various fields of study, for example: Advanced Aerodynamics, Algebra, and Accounting, just to name a few. So you might say I have experienced the online program from the viewpoint of a student, a proctor, an instructor, course developer, and in a limited way, an administrator! During the continual growth period there have been numerous changes and improvements. Please read more about me in my introduction posting.
I pledge to do my best as your instructor. Will you do the same as my student? If so, let's work together and hopefully we will all learn something new.
Last Updated:2/22/2010 9:49:40 AM