Syllabus Entrance
Printer Friendly
Email Syllabus

CS 208 Discrete Mathematics
Tankins, Edwin S.


Mission Statement: Park University provides access to a quality higher education experience that prepares a diverse community of learners to think critically, communicate effectively, demonstrate a global perspective and engage in lifelong learning and service to others.

Vision Statement: Park University, a pioneering institution of higher learning since 1875, will provide leadership in quality, innovative education for a diversity of learners who will excel in their professional and personal service to the global community.

Course

CS 208 Discrete Mathematics

Semester

U1H 2012 BU

Faculty

Tankins, Edwin S.

Title

Instructor CS

Degrees/Certificates

BS Metallurgical Eng, Univ Of Wisconsin
MS metallurgical Engineering, Univ Of Pennsylvania

Office Location

MCAS Beaufort Building 596 room 213

Office Hours

MWed 1630 - 1700 hrs

Daytime Phone

(843) 342 - 5050

E-Mail

Edwin.Tankins@park.edu

tankins@hargray.com

Semester Dates

4 JUN - 29 JULY 2012

Class Days

-M-WED---

Class Time

7:35- 10:05 PM (1935-2205)

Prerequisites

MA 131 or higher level course

Credit Hours

3


Textbook:

 
Dossey,Otto,Spence and Vandem Eynden, Discrete Mathematics, 5th Edition, Addison-Wesley, 2006
ISBN 0-321-30515-9

Textbooks can be purchased through the MBS bookstore

Additional Resources:

Electronic Resources to help with Discrete Mathematics problems- -
Check out www.purplemath.com, www.mathworld.com , www.mathforum.com or www.khanacademy.com
 
 

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:
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 > MA 131. 3:0:3.

Educational Philosophy:

I believe learning should be an enjoyable, challenging experience. I try to bring real world experiences to the class room. I try to bring excitement to learning by various approaches and grading criteria producing successful students. I consider quizzes and exams part of the learning experience; hence I don't always use closed book exams.

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:

Students are required to read all assigned material prior to class. Homework will be completed prior to class and will be reviewed during class. There will be quizzes, a midterm and final exam. In additional to the assigned exercises in the text there will be hand out exercises in class.

Grading:

Final grades will be based on the following weights:
Mid Term Exam     30%
Final Exam             40%
Homework             10%
Quizzes                  15%
Class Participation  05% 
Your overall score is determined as follows:
(your_total_hr_quiz_pts/max_quiz_pts)*15 + (your_total-homework_pts/
max_homework_pts)*10 + ( your_total _ part_pts/_total_part _pts)*05
+(your_total_mid_term exam_pts/max_mid-termexam_pts)*30 + ( your
_total_final exam_pts/max_final exam_pts)*40
 
Letter gradesare assigned ( based on your overall score) as follows:
 A = 90 % or above
 B = 80 - 89 %
 C = 70 - 79%
 D = 60 - 69%
 F = 59% or below

Late Submission of Course Materials:

Homework must be turned in at the beginning of class on the day it is due.
The date due will be annotated at the beginning of each assignment. Late
homework will be accepted at the start of the next class meeting but will
incur a 7 point (out of 100) reduction in score. The instructor will accept late
assignments if extenuating circumstances exist. Late homework will not be
accepted after a week past the due date and will receive an automatic zero
for the assignment. If you are going on TDY, then you are responsible to let me know.
 

Classroom Rules of Conduct:

Students must read all assigned chapters for that night prior to that
scheduled class meeting. Students are expected to be well prepared to
discuss examples and assignments provided at the end of each chapter or
handed out by the instructor. Students are expected to come to all classes
and be on time. Classes missed for legitimate reasons: illnesses, death in
the family, work assignments, and temporary duty are excusable. The student
is responsible for providing the instructor a reason for the excused absence
either prior to or immediately after the absence. No talking on cell phones
during the class. There will no consumption of food during the class lecture.
The student is expected not to be disruptive during the class.

Course Topic/Dates/Assignments:

Week

Class Activities,

Assignments,

Homework(Study) & Tests,

          I
Jun 4, 6 MWed
Ch 1 Elem Introd to combinational problems & Techniques
 
Ch 2 Sets, Relations & Functions
P1 - p40
 
 
 
P44 - p98
 
P 8 #'s  2,4,6&14, P15#'s 2,4,6&14, P22 #'s 2,4,6 P33 #'s 6,8&10, P37 # 2, 
 
 P46-7 #'s 2,4&6, P53 #'s 8,10&12, P64 #'s 6,8&10, P75 #'s 6,8,10
 Quiz 1
 
          II
Jun11 ,13  MWed
Ch 2 Sets, Relations & Functions
 Ch 4 Graphs
P44 _P98
P99 - P153
P83 #'s 2,4&6, P91 #'s 2&4,P176 #'s 6,8&30, P190 #'s 2,4&10,  Quiz 2
        III
Jun18, 20  MWed
Ch 4 Graphs        
P154 - P227

P199 #'s 2,4&8, P212 #'s 2,4&12
P161 #'s 2,4&6, P176 #'s 6,8&30, P190 #'s 2,4&10
      Quiz 3

       IV
Jun25, 27 MWed

Ch 4 Graphs 
Ch 5 Trees

P154 - P227
P228 -P312

 P234 #'s 2,4&10, P248 #'s 2,4&8, P263 #'s 2&4, P271 #'s 2,6&8, P285 #'s 8&10, P302 #'s 2,4&10
 Handouts in class   Quiz 4

       V
Jul 2,4 MWed  

MIDTERM EXAM
Ch 6 Matching

Ch 1 through Ch 5
P313 - P312

 
P318 #'s 6,10&12, P325 #'s 2&4, P336 #'s 2&4, P345 #'s 2,4&10, P353 #'s 2&4
     VI
Jul 9,11 MWed
Ch 7 Network Flows
Ch 8 Counting Techniques
P358 - P401
P402 - P457
 P367 #'s 2 &6, P379 #'s 2 &6, P386 #'s 6 &8, P386 #'s 6 & 8, P394 #'s 2 &6     P405 #'s 4,8 &10, P414 #'s 16,18&20, P432 #'s 2,8 &12,  
Handouts in class, Quiz 5
         VII
Jul 16, 18  MWed
Ch 8 Counting Techniques
Ch 9 Recurrence Relations & Generating Functions
P402 - P457

P458 - P528
 P419 #'s 6,10 &12, P426 #'s 2,4, 6 &8, P448 #'s 2,6 &8
P468 #'s 2,4,8 &10, P480 #'s 4,8 &10, P492 #'s 2,14 &16, P504 #'s 4,10 &12, P512 #'s 6 &8, P521 #'s 4,6 &12      Quiz 6
     VIII
Jul23, 25 MWed
Ch 10 Combinatorial circuits & Finite State Machines
FINAL EXAM
P528 - P573

Ch 6 - 10
P535 #'s 2,6 &8, P543 #'s 2 &10, P557 #'s 2 &6
Review Previous Assignments since midterm

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 students and faculty members are encouraged to take advantage of the University resources available for learning about academic honesty (www.park.edu/current or http://www.park.edu/faculty/).from Park University 2011-2012 Undergraduate Catalog Page 93

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. from Park University 2011-2012 Undergraduate Catalog Page 93

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 2011-2012 Undergraduate Catalog Page 96

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:4/9/2012 3:17:36 PM