CS 208 Discrete Mathematics
S2F 2008 HE
Law, David A.
B.S. United States Naval Academy, Systems EngineeringM.S. Boston University, Computer Information SystemsM.S. Naval Postgraduate School, Computer Science
5:00 - 10:00 PM
Prerequisite: MA 131 or higher-level course
(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.
(3) If you are looking for an equation editor, you can try Math Equation Editor, 30-day free trial version found in http://www.mathtype.com/en/products/mathtype/. MathType enables students to export or save the symbols into .gif or .jpg format. You can then insert the .gif/.jpg file in the assignments for submission.
You can also write your equations in hardcopy paper, scan your work, and save the file in .gif or .jpg format, and then insert the .gif/.jpg file in the assignments for submission.
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/.
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:
This course will consist of one mid-term examination, one final examination, weekly quizzes, and weekly homework assignments. Homework is submitted weekly and is graded for effort (i.e., did you attempt all the assigned problems). Quizzes are given in class weekly beginning in the second week. These are based on the previous week's homework set. The mid-term and final are 2 hrs; no books or notes are allowed. While students are free to collaborate on the homework, the quizzes, the mid-term and the final are strictly INDIVIDUAL EFFORT ONLY.
Late Submission of Course Materials:
No late work of any kind will be accepted. Assignments are expected to be completed by set deadlines. It is the responsibility of the student to start work early, not late.
NO EXTENSIONS WILL BE MADE.
You have all week to complete the homework; waiting until Wednesday is NOT a good plan. Notify the instructor WELL IN ADVANCE of any special circumstances, and each situation will be resolved on a case-by-case basis.
Classroom Rules of Conduct:
There should only be one person talking at a time. Side bar conversations will not be tolerated. While in class, the class should be your primary focus. Disruptions of class due to communications devices have become so prevalent that they are a major distraction in class (to you, to the instructor and to other students). For this reason such devices must not be brought to class or must be inactivated during the class lecture.
Students are expected to attend all classes and be on time.
The student is responsible for providing the instructor with justification for an excused absence prior to the absence.
Students must be responsible for planning ahead and meeting deadlines.
Students will conduct themselves in a professional manner at all times.
Students are expected to respect other students' opinions and values, even if they disagree with those opinions and values.
Week Topic Chapter
1 Logic and Proofs Appendix A
Combinatorial Circuits & Finite State Machines 10
2 Combinatorial Problems & Techniques 1
3 Sets, Relations & Functions 2
4 Recurrence Relations and Generating Functions 9
5 Trees 4
6 Graphs 5
7 Counting Techniques 8
8 Review and Final Examination
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 2007-2008 Undergraduate Catalog Page 85-86
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 2007-2008 Undergraduate Catalog Page 85
Attendance Policy:Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.
Park University 2007-2008 Undergraduate Catalog Page 87-88
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 .
Last Updated:2/24/2008 12:08:31 PM