Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Nguyen, Litti


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

S2W 2010 TI

Faculty

Nguyen, Litti

Title

Adjunct Faculty

Degrees/Certificates

B.S.
M.S.

Office Location

Tinker AFB

Office Hours

TBA

Daytime Phone

521-4175

Other Phone

682-0338

E-Mail

litti.nguyen@park.edu

Kozete@yahoo.com

Class Days

-M-W---

Class Time

7:30 - 10:20 PM

Prerequisites

MA 131 or higher-level course

Credit Hours

3


Textbook:

Dossey, Otto, Spence, Vanden Eynden; Discrete Mathematics, 5th Edition, Pearson Addison Wesley, ISBN 0-321-30515-9.

Textbooks can be purchased through the MBS bookstore

Textbooks can be purchased through the Parkville 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.

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:
(MA 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

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.


  Instructor Learning Outcomes
  1. 5. Use of counting techniques.
  2. 6. Use of proof methods.
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 final exam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Link to Class Rubric

Class Assessment:

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

Grading:

1) Examinations: 60 points (2 exams, 60% of the course grade)
2) Homework Assignments: 30 points (6 assignments, 30% of course grade)
3) Attendance and Class Discussion: 10 points (10% of course grade)
4) 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: 
Chapters 1: An Introduction to Combinatorial Problems and Techniques
Chapters 2: Sets, Relations, and Functions
Homework1 is assigned

Week2:
Chapter 3: Coding Theory
Chapter 4: Graphs
Homework1 is due
Homework2 is assigned

Week3: 
Chapter 5: Trees
Homework2 is due
Homework3 is assigned

Week4:
Homework3 is due
Midterm Review
Midterm Exam

Week5:
Chapter 6: Matching
Chapter 7: Network Flows
Homework4 is assigned

Week6: 
Chapter 8: Counting Techniques
Chapter 9: Recurrence Relations and Generating Functions
Homework4 is due
Homework5 is assigned.

Week7: 
Chapters 10: Combinatorial Circuits and Finite State Machines
Homework5 is due
Homework6 is assigned.

Week8:
Homework6 is due
Final Exam 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 2009-2010 Undergraduate Catalog Page 92

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 2009-2010 Undergraduate Catalog Page 92

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 "F".
  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 2009-2010 Undergraduate Catalog Page 95

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 
Component                                                                                                                                                                                                                                                  
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:2/23/2010 6:41:23 PM