|
OTTERBEIN COLLEGE DEPARTMENT OF MATHEMATICAL SCIENCES Math 155 Discrete Mathematics I Winter 2008 |
|
| Class | MWF 11:00 - 11:50 p.m. in Towers 114 (section -01)
TR 6:00 - 7:15 p.m. in Towers 114 (section -1E) |
|
| Class Web Page | http://www.otterbein.edu/home/fac/dvdjstck/Math155/LinkFrames.htm | |
| Instructor | David J. Stucki | |
| Office | Towers 133 | |
| Office Hours | MW 1:45 - 2:30, TR 5:00 - 6:00, or by appointment | |
| DStucki@otterbein.edu | ||
| Phone | 823-1722 | |
| Home Phone | 878-8002 (After 9 a.m. and before midnight, please) | |
Discrete structures is foundational material for computer science. By foundational we mean that relatively few computer scientists will be working primarily on discrete structures, but that many other areas of computer science require the ability to work with concepts from discrete structures. Discrete structures includes important material from such areas as set theory, logic, graph theory, and combinatorics.
The material in discrete structures is pervasive in the areas of data structures and algorithms but appears elsewhere in computer science as well. For example, an ability to create and understand a formal proof is essential in formal specification, in verification, and in cryptography. Graph theory concepts are used in networks, operating systems, and compilers. Set theory concepts are used in software engineering and in databases.
As the field of computer science matures, more and more sophisticated analysis techniques are being brought to bear on practical problems. To understand the computational techniques of the future, today's students will need a strong background in discrete structures.
-Computing Curricula 2001 Computer Science,
The Joint Task Force on Computing Curricula
IEEE Computer Society
Association for Computing Machinery
| Description | Elementary logic and propositional calculus with quantifiers, proof techniques (including induction and contradiction, contraposition and counterexample), intuitive set theory, functions and relations. |
| Prerequisites | Math 115 or Math 120. |
| Objectives | The student will become familiar with the fundamentals of the mathematics that underlies the foundations of computer science and engineering. This course will give students tools for utilizing precise vocabulary, powerful notation, useful abstractions, and rigorous thinking. In addition to developing skills through explanation, example, and much practice, the student will gain insight into the points of entrance that mathematics makes into computer science. |
| Text |
Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns, and Games
, Ensley, Douglas E., and Crawley, J. Winston, Wiley, 2006.
|
| Work Load | "Students are expected to spend three hours per week (including class hours) in study for each quarter hour of credit attempted." (From p. 300 of the Course Catalog, Autumn, 2005 - Summer, 2007, Otterbein College Bulletin, Vol. XCI.) Since Math 155 is 3 (Quarter) Credit Hours, 90 hours of study is expected: 30 hours in class (3 hours per week), and 60 hours beyond class hours (6 hours per week). |
| Homework |
Homework assignments will be made on a daily basis. It is a basic assumption
in this course that mathematics is learned by doing! It is also a cumulative
endeavor. Missing key concepts or techniques in one section can handicap you for
the remainder of the term. Practice, practice, and practice some more.
On the first class meeting each week, all the homework from the previous week will be collected in class. No late assignments will be accepted. |
| Quizzes | You should expect an average of one quiz per week. These quizzes will be short, unannounced, and most will be very similar to homework problems. |
| Exams | There will be two tests and a final exam. These will all be closed-book. They will cover lecture material, readings, and homework exercises. The final will be a comprehensive exam covering the entire course. Make-ups will be scheduled only for documented emergencies. If you can document that you have three or more exams scheduled for the same day I will attempt to arrange for an alternate time only if given at least a week’s notice. |
| Submissions | All homework submissions must be NEATLY hand-written or word processed. No spiral paper, one-sided, and a single staple in the upper-left corner (for multiple pages) are required! Failure to properly format the submission will result in a 5% deduction. |
| Participation | Each student is expected to participate in the class discussions and exercises throughout the semester. To this end, all assigned readings for each day should be completed before the class period in which they are discussed. |
| Academic Misconduct Policy |
All members of the Otterbein College community of learners are expected to follow
the rules and customs of proper academic conduct. Proper conduct includes avoiding
academic misconduct as defined in the Student Life Handbook. Students are
encouraged to help each other learn the course material. Unless specifically
prohibited, you may discuss homework problems and lab exercises with one another.
Participants in these discussions usually enjoy the benefit of deeper and greater
learning. However, all work submitted for evaluation that is based on discussions
with others must be your own work; created with your own hands and fingers while
thinking it through.
Any work submitted for evaluation that includes work done by another, copying of another's work, or the result of following another's step-by-step keystrokes and mouse clicks, is a case of academic misconduct. When academic misconduct is found in any assignment or examination you submit, you will receive a zero grade for that assignment or exam. The misconduct will also be reported to the Office of the Academic Dean. If a previous academic misconduct offense is on your record, you will receive a grade of F for this course and a referral to the judicial system. |
| Grading | Assignment | Weight | Range | Grade | Range | Grade | |
| Homework | 9% | 93 - 100% | A | 73 - 76.9% | C | ||
| Attendance | 6% | 90 - 92.9% | A- | 70 - 72.9% | C- | ||
| Quizzes | 15% | 87 - 89.9% | B+ | 65 - 69.9% | D+ | ||
| Midterm exams (2) | 40% | 83 - 86.9% | B | 60 - 64.9% | D | ||
| Final Exam | 30% | 80 - 82.9% | B- | 0 - 59.9% | F | ||
| 77 - 79.9% | C+ |
| Week | Text | Topics |
| (1) 1/7 - 1/11 | 1.1 - 1.2 | Overview; Puzzles & Patterns |
| (2) 1/14 - 1/18 | 1.3 - 1.5 | Logic |
| (3) 1/21 - 1/25 | 2.1 - 2.2 | Proof |
| Monday, 1/21 is Martin Luther King, Jr. Day - NO CLASSES | ||
| (4) 1/28 - 2/1 | 2.5 | Contradiction & the Pigeonhole Principle |
| TEST I | ||
| (5) 2/4 - 2/8 | 2.3 - 2.4 | Induction |
| (6) 2/11 - 2/15 | 3.1 - 3.2 | Sets |
| (7) 2/18 - 2/22 | 3.3 - 3.5 | Boolean Algebra |
| (8) 2/25 - 2/29 | 4.1 - 4.2 | Functions & Relations |
| TEST II | ||
| (9) 3/3 - 3/7 | 4.3 - 4.4 | Properties |
| (10) 3/10 - 3/14 | 4.5 - 4.6 | Equivalence Relations & Numerical Functions |
|
FINAL EXAM: Tuesday, March 18, 6:00 - 8:00 p.m. (evening section) Wednesday, March 19, 10:30 a.m. - 12:30 p.m. (day section) |
Note: This schedule is tentative and subject to change.