Instructor: Matthew Fricke |

**Mailing List:**

Introduction to the formal mathematical concepts of computer science. Topics include proofs, first-order logic, set theory, functional relations, graphs, cryptography, state machines, and combinatorics.

**Prerequisites**:
A minimum grade of C- in Computer Programming Fundamentals (CS151 or CS155 or CS152) and Calculus I (MATH162).

- Daily Class Exercises: 30% (1% each)
- Weekly Homeworks: 40% (5% each)
- Exams: 30% (Midterm 15% on July 1st; Final 15% on July 25th)

You may work together on the in-class exercises and homeworks. Use any resourse you find useful for the homeworks. No collaboration or resourses other than a pencil and paper are allowed during the exams. Exams will not be explictly comprehensive but, as with most math courses, comprehension of later topics depends on familiarity with earlier topics.

**Makeups**: There will be no makeups on the exercises or homeworks. If you miss an exam due to an unforeseeable emergency let me know as soon as possible and we will schedule a makeup. Makeup exams will be different from, but at least as hard as the regularly scheduled exam.

**Academic Integrity**: The University's policy on academic honesty can be found in the student handbook.

**Disabilities**: If you are a student who needs accessability services due to disability please let me know so that I can accomodate you. The Accessibility Resource Center website is at arc.unm.edu.

Title: Discrete Mathematics and its Applications 7th Ed. Author: Ken Rosen Publisher: McGraw-Hill Science Hardcover (2011): ISBN-10: 0073383090 ISBN-13: 978-0073383095 |

- Introduction (slides) Mon Jun 3:
- Logic and Proofs (slides, slides)
- Sets, Functions, Sequences, Sums and Cardinality (slides, slides)
- Number Theory and Cryptography (slides)
- Mathematical Induction and Recursion (slides)
- Counting (slides)
- Discrete Probability (slides)
- Exam 1 (slides) Thu Jun 27 Exam Review
- Recurrence Relations (slides)
- Relations (slides)
- Graphs and Trees (slides)
- Boolean Algebra (slides)
- Modelling Computation (slides)
- Exam 2 (slides) Wed Jul 24: Exam Review

Tue Jun 4:

Wed Jun 5:

Thu Jun 6:

Mon Jun 10: Homework 1 Due.

Tue Jun 11:

Wed Jun 12:

Thu Jun 13:

Mon Jun 17: Homework 2 Due

Tue Jun 18

Wed Jun 19

Thu Jun 20

Mon Jun 24: Homework 3 Due

Tue Jun 25

Wed Jun 26:

Mon Jul 1: Exam 1. Homework 4 Due

Tue Jul 2

Wed Jul 3

Mon Jul 8: Homework 5 Due

Tue Jul 9

Wed Jul 10

Thu Jul 11

Mon Jul 15: Homework 6 Due.

Tue Jul 16

Wed Jul 17

Thu Jul 18

Mon Jul 22: Homework 7 Due

Tue Jul 23

Thu Jul 25: Exam 2. Homework 8 Due.

Homework 2 (solution)

Homework 3 (solution)

Homework 4 (solution)

Homework 5 (solution)

Homework 6 (solution)

Homework 7 (solution)

Homework 8 (solution)