Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Green, Kathleen R.


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

U1T 2006 DLA

Faculty

Green, Kathleen R.

Title

Senior Adjunct Instructor

Degrees/Certificates

PhD - Adult Education
MBA - Business Administration
BA - Chemistry

Office Location

Mountain Home AFB, Idaho

Office Hours

0900 - 1500

Daytime Phone

208-794-6341

E-Mail

Kathleen.Green@pirate.park.edu

verdeaviation@cableone.net

Semester Dates

05 June - 30 July 2006

Class Days

TBA

Class Time

TBA

Prerequisites

Any Math Course > MA 131

Credit Hours

3


Textbook:
(1)  Discrete Mathematics, 4th Edition, Dossey, Otto, Spence, Vanden Eynden, Addison Wesley.
ISBN:  0-321-07912-4
(2)  Student's Solutions Manual to Discrete Mathematics, 4th Edition, Dossey, Otto, Spence, Vanden Eynden, Addison Wesley.
ISBN:  0-201-75483-5

Textbooks can be purchased though the MBS bookstore

Textbooks can be purchased though the Parkville Bookstore

Additional Resources:
If you are looking for an equation editor, you can try Math Equation Editor, 30-day free trial version found in http://www.mathtype.com/en/products/mathtype/. MathType enables students to export or save the symbols into .gif or .jpg format. You can then insert the .gif/.jpg file in the assignments for submission.
You can also write your equations in hardcopy paper, scan your work, and save the file in .gif or .jpg format, and then insert the .gif/.jpg file in the assignments for submission.


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:
My educational philosophy is one of interactiveness based on lectures, readings, dialogues, examinations, internet, videos, web sites and writings.  I will engage each student to encourage the lively exploration of ideas, issues, and contradictions. School should be fun not a chore. Anyone who works at it with diligence and courage can learn to think more clearly, accurately, and efficiently and express ideas with clarity and poise.

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


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:
Reading Assignments:
Students will be expected to read the assigned chapters in the textbook and the lectures. The Online Discussions, Homework Assignments, Quizzes and Final Proctored Examination assume you have read the assigned readings.
Class Participation (Online Discussions):
Students should visit the discussion area at least three times each week or a minimum three hours per week.
Homework Assignments & Quizzes
All assignments and quizzes should be completed on or before Sunday 11:59 pm Mountain Daylight time. Homework must be done independently. Students will place completed assignments in the dropbox. Do not post answers to quizzes or assignments in the discussion threads.
Note that weekly quiz 1 is to be taken on or before 11:59pm Mountain Daylight Time on Friday of the academic week to receive full credit (i.e., 3 points) for each correct answer. Between Saturday 12:00am Mountain Daylight Time and Sunday 11:59pm Mountain Daylight Time, each correct answer in weekly quiz 1 is worth 2 points. Weekly quiz 2 does not have this restriction.

Grading:
You will be able to track your average exactly throughout the course. The grading scale is as follows: A = 90%-100%; B = 80%-90%; C = 70%-80%; D = 60%-70%; F = 0-60%. You will know in advance the standards for each assignment. My goal is to give you prompt, clear, and useful feedback to help you to succeed in this class. Each student is responsible for:
Completing Weekly Reading assignments
Completing Weekly Discussions
Completing Weekly Homework assignments
Completing Weekly Quizzes
Completing a Final Examination. This step is essential!
Completing a Online Survey of Student Opinion of Teaching

Late Submission of Course Materials:
All assignments and quizzes must be completed by 11:59 pm Mountain Daylight Time on Sunday of the academic week. There will be 20% penalty for each day that a homework is turned in late. Students are not allowed to take a quiz that is scheduled beyond its due date.

Classroom Rules of Conduct:
Computers make writing and revising much easier and more productive.  Students must recognize though that technology can also cause problems.  Printers run out of ink and hard drives crash.  Students must be responsible for planning ahead and meeting deadlines in spite of technology.  Be sure to save copies of your work to disk, hard drive, and print out paper copies for backup purposes.

Course Topic/Dates/Assignments:
Week 1:  Introduction to Combinatorial Problems and Techniques (June 5 - June 11)
Read the Lecture.
Read the textbook chapter sections 1.1, 1.2, 1.3, and 1.4.
Participate in the threaded discussions.
Answer the assigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 2:  Sets, Relations, and Functions (June 12 - June 18)
Read the Lecture.
Read the textbook chapter sections 2.1, 2.2, 2.5, 2.6, and 2.7.
Participate in the threaded discussions.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 3:  Resursion and Logic (19 June - 25 June)
Read the Lecture.
Read the textbook chapter sections 8.1, 8.2, A.1, and A.2.
Participate in the threaded discussions.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 4:  Proof and Combinatorial Circuits
26 June - 02 July)
Read the Lecture.
Read the textbook chapter sections A.3, 9.1, 9.2, and 9.3.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 5:  Graphs (03 July - 09 July)
Read the Lecture.
Read the textbook chapter sections 3.1, 3.2, 3.3, 3.4, and 3.5.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 6:  Trees (10 July - 16 July)
Read the Lecture.
Read the textbook chapter sections 4.1, 4.2, 4.3, 4.4, and 4.5.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Take Weekly Quizzes.
Week 7:  Counting (17 July - 23 July)
Read the Lecture.
Read the textbook chapter sections 7.1, 7.2, 7.3, 7.4, and 7.5.
Answer the asssigned homework questions and post your answers in the Dropbox.
Perform Self-Check.
Week 8:  Final Exam Week (24 July - 30 July)
Review class materials from week 1 through week 7.
Complete a proctored final exam by Midnight Mountain Time on Friday of Week 8.


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.
ONLINE NOTE: An attendance report of "P" (present) will be recorded for students who have logged in to the Online classroom at least once during each week of the term. Recording of attendance is not equivalent to participation. Participation grades will be assigned by each instructor according to the criteria in the Grading Policy section of the syllabus.

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. 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:

Student 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.

Park University Online Bookstore - Select "Online Learning- Graduate," or "Online Learning - Undergraduate," and then click on the appropriate course code (ex. AC 201, PA 501) to see the list of required and optional texts for each course that you are enrolled in.

Advising - Park University would like to assist you in achieving your educational goals. Your Campus Center Administrator can provide advising to you, please contact them for assistance. If you need contact information for your Campus Center, click here.

Online Tutoring Services - Park University has arranged for Online students to receive five hours of free access to Online tutoring and academic support through Smarthinking. If you would like Online tutoring, please contact me to receive their recommendation and information on how to access the Online tutoring.

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.

Online Classroom Technical Support - For technical assistance with the Online classroom, email helpdesk@parkonline.org or call the helpdesk at 866-301-PARK (7275). To see the technical requirements for Online courses, please visit the http://parkonline.org website: click on the "Technical Requirements" link, and click on "BROWSER Test" to see if your system is ready.

Park Helpdesk - If you have forgotten your User ID or Password, or if you need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024.



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:5/4/2006 11:10:47 PM