Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Belanger, Fred


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

S2B 2009 BL

Faculty

Belanger, Fred

Title

Senior Instructor/Adjunct Faculty

Degrees/Certificates

B.S. General Engineering, U.S. Military Academy
M.S. Applied Science, University of California at Davis

Office Location

Fort Bliss, TX

Daytime Phone

915-568-5717

E-Mail

p198749@pirate.park.edu

Semester Dates

17 March - 5 May 2009

Class Days

--T-R--

Class Time

7:40 - 10:10 PM

Credit Hours

3


Textbook:
Dossey, Discrete Mathematics, Pearson-Addison Wesley, Fifth Edition, Boston, MA, 2006

Textbooks can be purchased through the MBS bookstore

Textbooks can be purchased through the Parkville Bookstore

Additional Resources:

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:
CS208 Discrete Mathematics: This course introduces the students 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. Prequisite: Any math course > MA131. 3:0:3.

Educational Philosophy:
Concepts and techniques will be presented and exercised with the students in order to develop capabilities to solve Discrete Mathematics problems in the areas covered in the course.

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 final exam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Link to Class Rubric

Class Assessment:
Two examinations of equal weight consisting of representative problems associated with the topics presented.

Grading:

The final grade in the course will be determined as follows:
Exam I........50% A............90% or above
Exam II.......50% B............80 to 89.99%
                           C............70 to 79.99% Total...100%
                           D............60 to 69.99%
                           F............Below 60%
 
A grade of "I" will not be allowed unless the student has met with the instructor and discussed the difficulties encountered.

Late Submission of Course Materials:
Only accepted with prior approval of instructor.

Classroom Rules of Conduct:

1. It is expected that all students will participate in the class by asking questions and by presenting problems as assigned.
2. Three (3) unexcused absences will result in a grade of F. All students are encouraged to consult with the instructor if he/she is expecting to be absent for legitimate reasons.
 
3. A student turning anybody else's work as his/her own will not be tolerated. If determined by the instructor that academic dishonesty has occurred in any part of the course, the student involved will normally be given an immediate grade of F and dropped from the course. The Dean of Academic Affairs will be notified in writing of the action taken. The added recommendation will be made to the Dean that the student involved be dropped from the college.

Course Topic/Dates/Assignments:

Date      Chapter          Topic
17 Mar  App A    Logic and Proof
19 May     1         Combinatorial Problems & Techniques
24 Mar     1         Combinatorial Problems & Techniques, cont.
26 Mar     2         Sets, Relations, and Functions
31 Mar     2         Sets, Relations, and Functions, cont.
  2 Apr      3         Coding Theory
  7 Apr A,1,2,3    Review Chapters A,1,2,3
  9 Apr A,1,2,3    Exam, Chapters A,1,2,3
14 Apr     4         Graphs 
16 Apr     5         Trees
21 Apr     8         Counting Techniques
23 Apr     8         Counting Techniques, cont.
28 Apr     9         Graph Theory
30 Apr     9         Graph Theory cont.
  1 May  4,5,8,9  Review Chapters 4,5,8,9  
  3 May  4,5,8,9  Exam, Chapters 4,5,8,9

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 2008-2009 Undergraduate Catalog Page 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 2008-2009 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 "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 2008-2009 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 .

Additional Information:
The final is a part of the core assessment and it is a department final. The final exam will be provided to the instructor by the Information and Computer Systems Department. Students will take the exam with Closed books, Closed notes, and Closed electronic devices.



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/27/2009 3:32:11 PM