Math 310 - Discrete Mathematics II
HU 326 -- Room 1358
Please note that this is a dynamic document!
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 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.
COURSE OBJECTIVESMath 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:
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.
HU CORE COMPETENCIES
TEXTBOOK and REFERENCES
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.
Your grade is based on 300 possible points. You earn points with each assignment, quiz, and the final (see below).
A: 279 to 300; A-: 270 to
278; B+: 261 to 269; B: 247 to
260; B-: 240 to 246; C+: 231 to
You earn your grade but it will be assigned by me. The criteria for each assignment will be discussed in detail, as well as the grading scheme. Each written assignment will be evaluated on how well it addresses the questions posed, the clarity of thinking, the organization and presentation of the material, the quality of writing, and its timeliness.
I urge all students to develop a web-based portfolio of their work and to keep copies of excellent assignments there as evidence of the quality of work that they are capable of producing.
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 Top of Page
TUTORING - PROBLEM SESSIONS (Office Hours)
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).
A few rules will help us to get the most of our investment in Math 310:
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 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!