Textbooks can be purchased though the MBS bookstore
Additional Resources: Optional: Students Solution Manual , ISBN 0-201-75483-5.
Course Description: This course introduces the student to selected finite systems to the study of computer science. Course topics will include the following: mathematical induction, sets, relations, functions, matrices, graphs, trees, combinatorial analysis, Boolean algebra, and other structures. Pre-requisite: Any math course > MA131. 3:0:3
Educational Philosophy: The instructor's educational philosophy is one of interaction through active involvement. This course will be primarily lecture based, however, students are always encouraged to: ask/answer questions, accomplish reading assignments, and practice/practice… In addition, there will be opportunities for students to demonstrate their understanding of materials covered.
Learning Outcomes:The objectives of this course are for each student to:
1. Increase their understanding of discrete (finite) systems, sets, operations, functions and mathematical induction.
2. Improve their problem-solving skills by designing and understanding computer algorithms.
3. Increase their confidence in solving abstract problems by using discrete applications/concepts.
4. Increase their understanding and use of technical language (e.g. sets, functions, graphs, trees, networks…etc.)
Course Assessment: Students are expected to read the sections to be discussed in class prior to the class and be prepared to work examples and ask questions. Mathematics can only be learned through practice, therefore, 15% of your grade will be based on homework. All examinations will be modeled from the homework problems, so there should be no surprises to students who have done the required homework. SHOW ALL OF YOUR WORK on homework assignments and exams! An answer with no work shown is either right or wrong; but, an answer showing your work may get some credit, even if it is not completely correct.
Grading: Homework 15%
Final Examination 45%
100-90 = A (4.0 honor points), 89+-80 = B (3.0 honor points), 79+-70 = C (2.0 honor points), 69+-60 = D (1.0 honor point), Below 60 = F (no honor points)
Late Submission of Course Materials: Assignments are due at the start of the assigned class period.
a. Late Homework: I do not accept late homework.
b. Make-up Examinations: Make-up examinations will only be given with a valid excused absence and approved by the instructor. Make-up exams will be given ONLY in cases of legitimate and documented reasons for absence. All make-up tests must be scheduled before the next class session or a zero will be given for the exam. If a make-up test is granted, I will schedule a day for taking the missed exam.
c. Incompletes: As a rule, incomplete grades will not be given. Incomplete grades will not be given for student laziness (i.e. work not in on time; missing exams; student missing final...etc.) Exceptions to the rule do exist, however: If a death in the student's immediate family (spouse, child, parent, grandparent, sibling, aunt, or uncle) affects the overall performance of the student in the course or if the student missies a significant portion of the class due to their hospitalization, the student may be allowed to petition for an incomplete and make up the work. The instructor retains the right to veto any such petition, or grant an incomplete in other unforeseen circumstances.
d. Withdrawals: The enrollment status of the student in this course is solely the responsibility of the student. If you wish to change your status in this course, be sure that you file the appropriate paperwork with the registrar before the appropriate deadlines. If you wish to drop, do not just stop coming to class!!!!
Get to the Campus Center Director and file a withdrawal slip. I will continue to consider you part of this Class until notified otherwise by the Campus Center Director.
Classroom Rules of Conduct: 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.
Course Topic/Dates/Assignments: 1 Introduction to Combinatorial Problems
and Techniques, Introduction to Logic
and Proofs 1, Appendix A
2 Sets, Relations and Functions 2, Appendix B
3 Graphs 3
4 Trees 4
5 (Mid-term Exam) Counting Theory 7
6 Recurrence Relations and Generating Functions 8
7 Combinatorial Circuits, Finite State Machines 9
8 Preparation for Final Exam - Take Final 1 - 4
7 - 9 AppendicesA/B
22 November (Mid-term Exam): Chapters 1-4
16 December (Final Exam): Covering Chapters 1-8 and supplemental information.
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 2004-2005 Undergraduate Catalog Page 101
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 2004-2005 Undergraduate Catalog Page 101
Attendance Policy:Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.
Park University 2004-2005 Undergraduate Catalog Page 100
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. Park University is committed to meeting the needs of all learners that meet the criteria for special assistance. These guidelines are designed to supply directions to learners 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 American with Disabilities Act of 1990, regarding learners with disabilities and, to the extent 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 .ADD/DROP: 25 October – 1 November 2004
LAST DAY TO WITHDRAW PASSING: 24 November 2004
Copyright:This material is copyright and can not be reused without author permission.