Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Phillips, Benny


Mission Statement: The mission of Park University, an entrepreneurial institution of learning, is to provide access to academic excellence, which will prepare learners to think critically, communicate effectively and engage in lifelong learning while serving a global community.

Vision Statement: Park University will be a renowned international leader in providing innovative educational opportunities for learners within the global society.

Course

CS 208 Discrete Mathematics

Semester

Spring 2, 2006 (S2W06 TI)

Faculty

Phillips, Benny

Title

Academic Director and Sr. Adjunct Professor

Degrees/Certificates

B.S
M.S.
Ph.D.

Office Location

Tinker AFB

Office Hours

By appointments

E-Mail

benny.phillips@park.edu

benny.phillips@sbcglobal.net

Semester Dates

Monday, March 20, 2006 - Saturday, May 13, 2006.

Class Days

-M-W---

Class Time

4:30 - 7:30 PM

Prerequisites

MA 131 or higher-level course.

Credit Hours

3


Textbook:
Discrete Mathematics, Richard Johnsonbaugh, Prentice Hall, 5th Edition, 2001, ISBN 0-13-089008-1.

Textbooks can be purchased though the MBS bookstore

Additional Resources:
1) A scientific calculator is required for the course.
2) Students need to download and install a free copy of LiveMath Viewer from LiveMath.com.  This Math software is used only by the instructor to demonstrate functions, matrices and operations. Students are not required to program in LiveMath.
3) Students need to download and install a free copy of a Prolog Compiler from http://www.dobrev.com (Strawberry Prolog 2.5, Light Edition).  This Prolog compiler is only used by the instructor to demonstrate Logic Modeling, Search, Paths, Graphs, Tree.  Students are not required to program in Prolog.
4) Students need to download and install a free copy of Java Compiler 1.5 from http://www.sun.com.  This compiler is used only by the instructor to demonstrate computer programming algorithms, tree traversal methods.  Students are not required to program in Java.
5) A laptop computer is strongly recommended.


Course Description:
(MA208) 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,   combinatorial analysis, Boolean algebra, and other structures.  Prerequisite:   Any math course >= MA131. 3:0:3

Educational Philosophy:
The facilitator's educational philosophy is one of interactiveness based on lectures, readings, quizzes, dialogues, examinations, internet, videos, web sites and writings. The facilitator will engage each learner in what is referred to as disputatious learning to encourage the lively exploration of ideas, issues and contradictions.

Learning Outcomes:
  Core Learning Outcomes

  1. Solve problems involving: set operations, equivalence and partial ordering relations, mathematical induction
  2. Analyze graphs, paths, circuits, graph coloring, direct 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. Use counting techniques
  7. Solve problems involving permutations, combinations, and probability
  8. Solve problems involving recurrence relations and generating functions


  Instructor Learning Outcomes
  1. Solve problems involving logic and proofs
  2. Solve problems involving Boolean algebras and combinatorial circuits
Core Assessment:

Class Assessment:
Attendance and class discussion, homework assignments, term project, quizzes, and examinations will be included in the student's assessment.

Grading:
1) Examinations: 40 points (2 exams, 40% of the course grade)
2) Homework Assignments: 20 points (6 assignments, 20% of course grade)
3) Quizzes: 20 points (4 quizzes, 20% of the course grade)
4) Term Project: 10 points (10% of course grade, involving Mathematical Induction)
5) Attendance and Class Discussion: 10 points (10% of course grade)
6) Letter Grades: A >= 90 points, 80 <= B <90, 70 <= C < 80, 60 <= D <70, F < 60.

Late Submission of Course Materials:
Late work will not be accepted without prior arrangements with the instructor.

Classroom Rules of Conduct:
Students will arrive to class on time and return punctually from any breaks. Students will be courteous to other students and the instructor.

Course Topic/Dates/Assignments:
Week1:
Logic, Proofs, and the Language of Mathematics (Chapters 1, 2), Homework1 is assigned (specific problems to solve in all homework assignments will be posted in eCompanion)

Week2:
Algorithms (Chapter 3), Homework1 is due, Quiz1 is given, Homework2 is assigned

Week3:
Couting Methods (Chapter 4), Homework2 is due, Quiz2 is given, Term Project is assigned (project specification will be posted in eCompanion), Homework3 is assigned

Week4:
Homework3 is due, Review/Midterm Exam

Week5:
Graph Theory (Chapter 6), Homework4 is assigned

Week6:
Trees (Chaper 7), Homework4 is due, Quiz3 is given, Homework5 is assigned.

Week7:
Boolean Algebras and Combinatorial Circuits (Chapters 9), Homework5 is due, Quiz4 is given, Homework6 is assigned.

Week8:
Homework6 is due, Term Project is due, Course Review & 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 2005-2006 Undergraduate Catalog Page 85-87

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.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  3. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "WH".
  4. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  5. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  6. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2005-2006 Undergraduate Catalog Page 89

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 .

Copyright:

This material is copyright and can not be reused without author permission.