The goal of this course is the introduction to central mathematical concepts that arise in computer science.

The emphasis will be on building abstraction skills and understanding the proof techniques that are necessary.

Topics that will be taught include more or less the first ten chapters of the basic textbook.

### COURSE INFORMATION

*Time*: Tuesdays 6:00 - 8:20 p.m.

*Place*: room 102 CIWW

*Textbook*: Discrete Mathematics and its Applications - Kenneth Rosen (6th Edition)

*Mail List*: http://www.cs.nyu.edu/mailman/listinfo/g22_2340_001_su09

*Homework*: 4 Homework Assignments will be distributed throughout the semester

*Midterm*: Take-home (28-30 June)

*Final*: In-class (4 August)

*Grading*: Mostly based on in-class participation and homework (exams will weigh less than 25%)

### LECTURES

A rough estimation of how the lectures will be distributed:

1 The Foundations: Logic and Proofs (1 lecture)

2 Basic Structures: Sets, Functions, Sequences and Sums (1 lecture)

3 The Fundamentals: Algorithms, the Integers, and Matrices (1 lecture)

4 Induction and Recursion (2 lectures)

5 Counting (2-3 lectures)

6 Discrete Probability (1-2 lectures)

7 Advanced Counting Techniques (1 lecture)

8 Relations (1 lecture)

9 Graphs (1/2 lecture)

10 Trees (1/2 lecture)