Syllabus Entrance
Printer Friendly
Email Syllabus

MA 208 Discrete Mathematics
Maldonado, Aldo Rene


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

MA 208 Discrete Mathematics

Semester

F2A 2006 BE

Faculty

Maldonado, Aldo Rene

Title

Associate Professor

Degrees/Certificates

Doctor of Philosophy (PhD)
Master of Science (MS)
Bachelor of Science (BS)

Office Location

Austin Room 102

Office Hours

Tuesday and Thursday 5-8 PM

Daytime Phone

(512)796-8940

Other Phone

(512)238-7535

E-Mail

aldo.maldonado@Park.edu

aldo.maldonado@gmail.com

aldo_maldonado@hotmail.com

Semester Dates

October 23 – December 17, 2006

Class Days

-M-W---

Class Time

5:10 - 7:50 PM

Prerequisites

MA131 equivalent or higher

Credit Hours

3


Textbook:
Discrete Mathematics, fourth edition, Dossey, Otto, Spence and Vanden Eynden, 2002; ISBN 0-321-07912-4

Textbooks can be purchased through the MBS bookstore

Additional Resources:
Scientific Calculator is required

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 helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.


Course Description:
(CS 208) This course introduces the student to selected finite systems pertinent to the study of computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra, combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence relations, graphs, trees, and counting techniques. PREREQUISITE: any math course > MA 131. 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:
  Core Learning Outcomes

  1. Explain and solve problems involving logics, Boolean algebra, combinatorial circuits, sets, relations, and functions, proofs, mathematical induction, and recurrence relations.
  2. Explain and solve problems involving graphs, paths, circuits, graph coloring, directed graphs, shortest path algorithms.
  3. Explain and solve problems involving trees, spanning trees, rooted trees, binary trees, and tree traversal algorithms.
  4. Explain and solve problems involving counting techniques such as permutations, combinations, binomial theorem, and probability.


Core Assessment:
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 finalexam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Link to Class Rubric

Class 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 %
HW 15%
MIDTERM 30%
FINAL 40 %

 

IMPORTANT DATES:
ADD/DROP: October 23 - October 30, 2006
LAST DAY TO WITHDRAW: November 26, 2006

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

 

Class Activities

Assignments

Week 1

Introduction to Combinatorial Problems and Techniques, Introduction to Logic and Proofs

Chapter 1 and Appendix A

Week 2

Sets, Relations and Functions

Chapter 2

Week 3

Graphs

Chapter 3 Appendix B

Week 4

Trees

Chapter 4

Week 5

Counting Theory, MIdterm

Chapter 7

Week 6

Recurrence relations

Chapter 8

Week 7

Combinatorial Circuits, Finite State Machines, Boolean Algebra

Chapter 9, handout

Week 8

Review and Final

Review and FInal


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 2006-2007 Undergraduate Catalog Page 87-89

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 2006-2007 Undergraduate Catalog Page 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 "W".
  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 2006-2007 Undergraduate Catalog Page 89-90

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 .



Rubric

CompetencyExceeds Expectation (3)Meets Expectation (2)Does Not Meet Expectation (1)No Evidence (0)
Synthesis                                                                                                                                                                                                                                                  
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Analysis                                                                                                                                                                                                                                                   
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Evaluation                                                                                                                                                                                                                                                 
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Terminology                                                                                                                                                                                                                                                
Outcomes
1,2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Concepts                                                                                                                                                                                                                                                   
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Application                                                                                                                                                                                                                                                
Outcomes
1, 2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 
Whole Artifact                                                                                                                                                                                                                                             
Outcomes
1,2, 3, 4                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            
Demonstrate mastery of 4 questions Demonstrate mastery of 3 questions Demonstrate mastery of 2 questions Demonstrate mastery of 0-1 questions 

Copyright:

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

Last Updated:9/12/2006 5:04:21 PM