Discrete Mathematics

Description

This course covers the mathematical topics most directly related to computer science. Topics include: logic, functions, basic set theory, counting arguments, proof techniques, combinatorics, discrete probability, Boolean algebra, and number theory. Emphasis will be placed on providing a context for the application of the mathematics within computer science.

Prerequisite: MAT 172 or placement by the Department of Computer Science.

Course Objectives

At the end of the course, students should be able to:

1. Simplify and evaluate basic logic statements including compound statements, implications, inverses, converses, and contrapositives using truth tables and the properties of logic.

2. Apply the operations of sets and use Venn diagrams to solve applied problems.

3. Use elementary number theory including the divisibility properties of numbers to perform modulo arithmetic and computer arithmetic.

4. Solve counting problems by applying counting techniques using the product and sum rules, permutations, combinations, and the pigeon-hole principle.

5. Solve discrete probability problems and use sets to solve problems in probability theory.

Grading Policy

Expectations: Students are expected to learn both the material covered in class and the material in the textbook and other assigned readings. Completing homework is an essential part of the learning experience.

Honor Code: You are encouraged to work together on understanding the concepts and problem-solving techniques introduced in this class. However, for specific homework assignments, all work must be your own. You are responsible for knowing and following CUNY Policy on Academic Integrity (available from the Undergraduate Bulletin, Graduate Bulletin, or the Office of Academic Standards and Evaluations).

Email: I will be communicating with you on a regular basis throughout the semester using your email address on Blackboard. You must check your email on a regular basis. There will be no acceptable excuse for missing an email announcement.

Homework: Assignment problems are due most weeks. Problems will be announced on Blackboard. To receive full credit for the homework, it must be completed by the specified due date and all questions should be answered. You will be allowed to submit your solution multiple times before the due date, the submission with the highest grade will count as your grade.

Exams: There will be two midterm exams and a final exam.

Grades: The grading for the course will be based on:

· Participation & In-class activities: 10%

· Homework Problems: 40%

· Midterm Exam 1: 15%

· Midterm Exam 2: 15%

· Final Exam: 20%

Since the final exam is comprehensive, if you do better on the final exam than the midterm exams, the final grade can replace those grades. The dates of exams will be announced at least one week before the exam day. There are no make-up exams.

Materials and Resources

Required Textbook:

  • Discrete Mathematics and its Applications
  • by Kenneth H. Rosen
  • Hardcover: 1072 pages
  • Publisher: McGraw-Hill Science/Engineering/Math;
  • 7th edition (June 14, 2011)
  • ISBN: 0073383090

Tutoring

Departmental tutoring is available in the Math Lab in GI-222.

Accommodating Disabilities

Lehman College is committed to providing access to all programs and curricula to all students. Students with disabilities who may need classroom accommodations are encouraged to register with the Office of Student Disability Services. For more info, please contact the Office of Student Disability Services, Shuster Hall, Room 238 (Phone: 718-960-8441).