Math 310 - Discrete Mathematics II
Semester II - Spring 2013


Lecture:  Tuesday & Thursday -- 12:30 PM - 1:59 PM 
HU 326 -- Room 1358

Professor

Office

Office Hours

Office Phone

E-Mail

Dr. Joseph E. Cannon

Room 1334

See Below

717.901.5119

  Dr. Cannon

Please note that this is a dynamic document!
Changes will be announced in class and posted on the course's web page
on Moodle as required.

 
Dr. Cannon's Home Page

COURSE OVERVIEW

This course is a continuation of MATH 210.  The topics covered will include, but not be limited to, the study of Boolean algebra, finite state machines, recursive functions, trees, the growth of algorithms, and models of computation.  This course is taught using an Object Oriented Programming language and includes an interactive programming component.

The purpose of Math 310 is to provide students with a deeper understanding of an array of mathematical concepts and methods which form the foundation of modern information science, in a form that will be relevant and useful for CISc students.  Discrete Mathematics plays a fundamental role for computer science which is similar to that played by calculus for physics and engineering.  Many concepts in computer science are best understood from a perspective that requires expertise with mathematical tools as well as certain reasoning skills associated with mathematically maturity.

The goal of this course is for the student to acquire the advanced knowledge required to develop computer software and the skills needed to integrated this software into the workplace environment.  There is an emphasis on practical computing skills and productivity techniques.  The programming section of the course will provide an understanding of how to design, code, and debug applications using basic problem-solving techniques utilizing an Object Oriented Programming language.

The course will explore these topics through in-class presentations/projects/exercises (both individual and group-based), discussions, readings (from both text and on-line sources), and a variety of graded assignments/labs/tests.  As part of this course we will explore the major organizations, government institutions and private sector industries and educational programs connected with our major topics.

Back to Syllabus Contents 

Back to Top of Page 


COURSE OBJECTIVES

Math 310 will be structured as a small number of modules.  Each module will introduce a group of mathematical concepts and present applications of those concepts to problems of information storage, information retrieval, information management, etc.  These include: At the conclusion of this course, the students should be able to:

Note to students with disabilities:  It is Harrisburg University's policy not to discriminate against qualified students with documented disabilities.  It is also your instructor's policy to try and help students learn by whatever reasonable means necessary.  If you have a disability related need that requires a modification in your testing situation, please notify your instructor a week before the first test or quiz so that your need can be accommodated. You may be asked to present documentation that describes the nature of your disability and the recommended remedy.

Back to Syllabus Contents 

Back to Top of Page 


HU CORE COMPETENCIES

    At the conclusion of this course a student will have met the following core competencies that reflect HU's mission:
    • Critical Thinking and Problem Solving skills are demonstrated by the student’s ability to:
      - Identify and clarify the problem,
      - Gather information,
      - Evaluate the evidence,
      - Consider alternative solutions,
      - Choose and implement the best alternative.
       
    • Communication - The core communication skills are demonstrated by the student’s ability to:
      - Express ideas and facts to others effectively in a variety of formats, particularly written, oral, and visual formats,
      - Communicate effectively by making use of information resources and technology.
    • Teamwork and Collaboration - The students will be working with others to increase involvement in learning and by sharing one's own ideas and responding to others' reactions to sharpen thinking and deepen understanding.
    • Information Technology - The students will be making effective use of the Internet, information resources, and technology.

Back to Syllabus Contents 

Back to Top of Page 


TEXTBOOK and REFERENCES

  • Kolman, B., Busby, R. C., and Ross, S. C., Discrete Mathematical Structures, 6th Edition, Pearson/Prentice Hall,
    ISBN-13: 978-0-13-229751-6, 2009. 
  • (P) Papers, programs, and online references will be made available to supplement the text.
  • Reference Books:
    Malik, D. S., and Sen, M. K., Discrete Mathematical Structures: Theory and Applications, Thomson/Course Technology, ISBN: 0-619-21285-3,
       2009. 
    Dossey, J. A., Otto, A. D., Spence, L. E., and Eynden, C. V., Discrete Mathematics, 5th Edition, Pearson/Addison-Wesley Publishing Company,  
       ISBN: 0-321-30515-9, 2006..
    -  Rosen, K. H., Discrete Mathematics and its Applications, 6th Edition, McGraw-Hill Publishing, ISBN: 0-072-88008-2, 2007.

Back to Syllabus Contents 

Back to Top of Page 


STATEMENT ON ACADEMIC INTEGRITY

    According to the University's Student Handbook: Academic integrity is the pursuit of scholarly activity free from fraud and deception, and is the educational objective of this institution.  Academic dishonesty includes, but is not limited to cheating, plagiarism, fabrication of information or citations, facilitating acts of academic dishonesty by others, unauthorized possession of examinations, submitting work of another person, or work previously used without informing the instructor, or tampering with the academic work of other students.  Any violation of academic integrity will be thoroughly investigated, and where warranted, punitive action will be taken.

    Students should be aware that standards for documentation and intellectual contribution may depend on the course content and method of teaching, and should consult the instructor for guidance in this area.

    Honor Code - We as members of Harrisburg University community pledge not to cheat, plagiarize, steal, or lie in maters related to academic work.  As a Community of Learners, we honor and uphold the HU Honor Code.

Back to Syllabus Contents 

Back to Top of Page 


GRADING

Back to Syllabus Contents 

Back to Top of Page 


PROBLEMS ARISE

    Problems happen to people when they are least expected.  If any problems arise that you expect could impact your work in Math 310 -- PLEASE CONTACT ME AS SOON AS POSSIBLE!  I want to see every student succeed -- but I can only help if I know as soon as possible!

Back to Syllabus Contents 

Back to Top of Page 

TUTORING - PROBLEM SESSIONS (Office Hours)

Dr. Joseph E. Cannon

Day

Hours

 Room
Monday 11:00 am to 12:30 pm
and
2:00 pm to 4:00 pm
1334
Wednesday 11:00 am to 12:30 pm
and
2:00 pm to 4:00 pm
1334
Friday By Appointment Only 1334

Back to Syllabus Contents 

Back to Top of Page 


PROJECT AND EXAM DESCRIPTIONS

    There are written assignments, quizzes, and a final exam.  Please consult the schedule to see when the assignments are due and when the quizzes and exams are scheduled. You will receive written instructions for each assignment well in advance of the due date.

    Here is a brief description of each:

      Homework Assignments - Each student is responsible for completing the Homework Assignments in accordance with the specifications in the text.  There will be twelve (12) Homework Assignments, each worth a maximum of five (5) points.  The two lowest assignment grades will be dropped.

      Quizzes - There will be six (6) quizzes, each worth a maximum of ten (10) points.  The lowest quiz grade will be dropped.

      MidTerm Examination - This examination will cover the class material up to the midpoint of the semester and is worth a maximum of a hundred (100 points).

      Final Examination - This will be a comprehensive examination that covers all the course material and is worth a maximum of a hundred (100 points).

Back to Syllabus Contents 

Back to Top of Page 


COURSE CONDUCT

    A few rules will help us to get the most of our investment in Math 310:

    • Classes will start on time and end as scheduled.  Please take your seat prior to the start of class.
    • You will attend each class and actively participate in the discussions during class.  If you are uncomfortable with public speaking, or if English is not your native language, please talk to the instructor in the first two weeks of the course to establish ways to make you more comfortable in speaking and interacting with other students (your peers).
    • For every hour of class time, I anticipate that you will need to budget about 3 hours of out-of-class time.  This implies that you need to budget about 120 hours of out-of-class time over the course of the semester.  This time estimate is a guide and you may need to budget more.  For example, if the material is new to you or difficult to comprehend, it will require more of your time.
    • You are responsible for all the readings, even if the material is not explicitly covered in class.  You should read the class materials prior to class and be prepared to discuss and ask questions about the readings and assignments.  You should also re-read the material after class as not every topic will be covered during class time.  Many passages in the text may need to be read several times to gain clarity.  Also, taking notes on the material you are reading and reflecting on the reading and these notes will help you better understand the issues, concepts and techniques that are being presented.
    • All work must be completed and turned in on or before the assigned date.  No late work will be accepted.  Late means after the class has begun.  Note that a computer's failure is not an excuse (it represents poor planning on your part).
    • All work must be done using a word processor.  Carefully proofread your work since mistakes which include spelling errors, grammatical errors, and typos will affect your grade.
    • Your work should be properly referenced and adhere to standards of both academic integrity and proper form.  Generally, I prefer the APA style (see http://www.apa.org/).
    • All class credit-related electronic mail must be done using Harrisburg's electronic mail service and the student's assigned Harrisburg University ID.  By 'credit-related' I mean all work to be evaluated for credit.  Any work submitted through a different mail system will NOT be accepted.

      NOTE:  If you use a friend's computer - be sure to change the identity information so that the work comes through YOUR account!  Work will not be accepted if it does not come from the student's Harrisburg University account.

    • When individual work is assigned it should be done by you, alone.
    • Students who participate in University-sanctioned events (such as athletics) must make prior arrangements and give the instructor ample notice.  Missing class for practice is not advised.

Back to Syllabus Contents

Back to Top of Page


CLASS SCHEDULE

    This list represents the initial plan for Math 310.  Please note that it is merely a *plan*Actual dates may change due to weather, illness or other unforeseen problems.  Please use this as a guide.

    Plan last updated: 8-Januay-2013
    (Note that all changes/updates to this plan will be maintained on Moodle)

    Note in the 'Readings' section, the dates shown are when the material should have been read.  I will not use class lectures to cover everything contained in the text or other readings.  Please let me know if you do not understand something that is covered in the text or in any other required reading!

Week

 Date

In Class Readings Due

1

8-Jan-13

Growth of Functions

Chapter 5.3

 

2

15-Jan-13

Finite Boolean Algebras

Chapter 6.4

 Assignment 1:  Page 204 - Odd Exercises 1 to 25

3

22-Jan-13

Functions on Boolean Algebra

Chapter 6.5

 Assignment 2:  Page 249 - Odd Exercises 11 to 21

 Quiz #1 - 1/24/2013

4

29-Jan-13

Circuit Design

Chapter 6.6  Assignment 3:  Page 253 - Odd Exercises 1 to 23

5

5-Feb-13

Trees Chapter 7  Assignment 4:  Page 263 - Odd Exercises 1 to 29

 Quiz #2 - 2/7/2013

6

12-Feb-13

Spanning Trees Chapter 7  Assignment 5:  Page 294 - Odd Exercises 1 to 25
7 19-Feb-13 Graphs Chapter 8.1  Assignment 6:  Page 300 - Odd Exercises 1 to 25

 Quiz #3 - 2/21/2013

8

26-Feb-13

 Review - Chapters 5 to 8

Midterm Exam - February 28, 2013

9 5-Mar-13 Euler Paths & Circuits Chapter 8.2  Assignment 7:  Page 310 - Odd Exercises 1 to 25
10 12-Mar-13 No Classes - Spring Recess
11 19-Mar-13 Hamiltonian Paths & Circuits Chapter 8.3  Assignment 8:  Page 316 - Odd Exercises 1 to 25
12 26-Mar-13 Transport Networks Chapter 8.4  Assignment 9:  Page 324 - Odd Exercises 1 to 21

 Quiz #4 - 3/28/2013
13 2-Apr-13
Finite State Machines Chapter 10.3  Assignment 10:  Page 407 - Odd Exercises 1 to 25

 Quiz #5 - 4/4/2013
14

9-Apr-13

Coding Chapter 11  Assignment 11:  Page 426 - Exercise 11

 Quiz #6 - 4/11/2013
15

16-Apr-13

Review - Chapters 8 to 11 (P)  Assignment 12:  Page 447 - Odd Exercises 1 to 9
The Final Examination will be on Tuesday, April 23, 2013.

Back to Syllabus Contents

Back to Top of Page