Textbooks can be purchased through the MBS bookstore
Course Description: This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include the following: mathematical induction, sets, relations functions, matrices, graphs, trees, combinational analysis, Boolean algebra, and other structures. Pre-requisite: Any math course > MA131. 3:0:3
Educational Philosophy: My philosophy is based on the constructivist view of mathematics learning. Students construct their own schema. Instructor provides guidance like lectures, HW assignment and tutoring but learning task is placed entirely on student's shoulders. Full use of technology is one of the ways instructor guides students
Learning Outcomes:1. Solve problems involving:
Equivalence and partial ordering relations
2. Explain graphs, paths, circuits, graph coloring, directed graphs;
3. Apply shortest path algorithms to graphs;
4. Explain tree properties, spanning trees, rooted trees, binary trees;
5. Apply tree search and tree traversal algorithms to trees;
6. Explain counting techniques;
7. Solve problems involving permutations, combinations, and probability;
8. Solve problems involving recurrence relations and generating functions.
Course Assessment: 1 midterm, 1 comprehensible final, Quizzes and Homework.
Midterm, quizzes final and HW consist of question and mostly problems at the level of and based in textbook.
Grading: Quizzes 15 %
FINAL 40 %
ADD/DROP: October 24 - October 31, 2005
LAST DAY TO WITHDRAW: November 27, 2005
Late Submission of Course Materials: No late submission is allowed
Classroom Rules of Conduct: Cell phones and pagers must be turned off to prevent unnecessary disruptions during the class. Disruptive behavior, racist, or sexist speech out of context will not be tolerated
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 2005-2006 Undergraduate Catalog Page 85-87
Attendance Policy:Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.
Park University 2005-2006 Undergraduate Catalog Page 89
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:
Copyright:This material is copyrighted and cannot be reused without author permission