MATH2080 DISCRETE MATHEMATICS FOR COMPUTER SCIENCE
Catalog Description: Propositional and first order logic, constructive proofs, mathematical induction, set theory, relations, functions, recursions, computability and recurrence relations, graph theory and graph algorithms, Turing machines.
Goals:
Course Objectives: Upon satisfactory completion of this course a student will:
Course Outline:
Text and Materials: Schumacher, Carol; Chapter Zero: Fundamental Notions of Abstract Mathematics, 2nd Edition, Addison-Wesley Publishing Co., 2000.
Prerequisite: A grade of C or better in MATH1020 and MATH1090, or MATH1100, or consent of the instructor
Course Requirements: A passing average on major exams including a comprehensive Final Exam. There may be additional requirements for satisfactory completion of this course.
It is the policy of NSU to accommodate students with disabilities, pursuant to federal law, state law, and the University’s commitment to equal educational opportunities. Any student with a disability, who needs accommodation, for example in seating placement or in arrangements for examinations, should inform the instructor at the beginning of the course. Students with disabilities are encouraged to contact the Office of Disabled Student Services, which is located in Kyser Hall, Room 237, telephone 357-6950 or (TTD) 357-4393 or disability@nsula.edu.
MWF 9:00 - 9:50 Kyser 425
| Test | Approximate Date |
| 1 | October 13 |
| 2 | November 19 |
| Final | December 15, 8:00 AM |
All exams will consist both of definitions and other short-answer questions and proofs.
Homework:
Each day I will give you a brief quiz over the definitions and statements of theorems from your reading. In addition, I will assign particular Problems from the text which will usually be due the next class meeting. Occasionally, I will assign group projects. I will drop 3-5 of your lowest grades when computing your homework average.
Presentations:
The majority of this class will be devoted to the students making presentations at the board. As you complete reading assignments, you are responsible for all Examples and Exercises. Thus, you should insure that all your questions about the reading have been answered in office hours before you come to class. As long as the quality of your presentations improves as the semester goes on, you will not be penalized for your errors. By the next class meeting, you must turn in a written copy of the problem(s) you presented. If we reach a point where no one is prepared to present, I will divide you into groups and we will continue with group presentations at the beginning of the next class. Your performance in these presentations will be evaluated to obtain your class participation grade.
Grading:
Each of the two tests, the Final, your class participation, and your homework average count for 20% of your grade. The approximate grading scale will be:
| 90-100 | A |
| 80-89 | B |
| 70-79 | C |
| 60-69 | D |
| 00-59 | F |
I reserve the right to curve the grades in your favor.
Class Policies:
If your Final Exam score is higher than the lower of your two test scores, I will drop that score and your Final will count for 40% of your grade.
Cheating will not be tolerated. If you are caught cheating on a test, you will receive a 0 on that test. If you are caught cheating on the Final, you will receive an F in the course.
Attendance is mandatory. If you miss a class, you should submit a written excuse to me within 3 days of your return to class. If you miss more that 3 classes, it will negatively affect your grade.
Sept 3 Turn in Group Project. Be ready to discuss 16 problems on page 8