Textbooks can be purchased though the MBS bookstore
Supplemental materials on Boolean Algebra will be provided to the student.
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: MA 131 or higher-level course> MA131. 3:0:3
The instructor's educational philosophy is one of interactiveness based on lectures, readings, quizzes, dialogues, examinations, Internet, videos, web sites, and creative writings. The instructor will engage each learner in what is referred to as disputatious learning to encourage the lively exploration of ideas, issues, and contradictions. Helping students to develop life-long learning skills is the goal of education.
Upon completion of this course, the student should be able to:
1. Solve problems involving:
1) Set operations
2) Equivalence and partial ordering relations
3) Mathematical induction
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.
Required readings, homework assignments, examinations.
Make-up examinations must be scheduled prior to the date of the examination. The final grade will be determined as follows:
Homework Assignments 20%
Midterm Exam 40%
Final Exam 40%
A = 100 – 90
B = 89 – 80
C = 79 – 70
D = 69 – 60
D = 69 – 60
Late Submission of Course Materials:
Assignments are due on the due date, no credit for late submission of assignments.
Classroom Rules of Conduct:
Students are expected to be courteous to each other and behave professionally. Each student is expected to complete all reading assignments prior to class and be prepared to participate in all class activities and discussions.
Add/Drop Deadline: October 25 -- November 1, 2004
Last Day to Withdraw: November 28, 2004
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
Instructors are required to maintain attendance records and
to report absences via the online attendance reporting system.
Park University 2004-2005 Undergradute
Catalog Page 100
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 .
This material is copyrightted and cannot be re-used without the author's permission.