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.

The target group includes students that want to remember/learn how to grasp and argue about abstract notions.

After this course you should be able to formally define statements and prove that they are true or false.

### COURSE INFORMATION

*Time*: Wednesdays 6:00-8:20 pm

*Place*: room 202 CIWW

*Textbook*: Discrete Mathematics with Applications (Third Edition) Susanna S. Epp

*Alternative textbook*: Discrete Mathematics and its Applications (Sixth Edition) Kenneth H. Rosen

*Mail List*: Click here

*Homework*: 4 Homework Assignments (see corresponding section)

*Midterm*: Take-home (25-27 June 2010)

*Final*: In-class (On 08/04/2010)

*Grading*: Mostly based on in-class participation and homework

### LECTURES

A rough estimation of how the lectures will be distributed:

1 The Logic of Compound Statements (2 lectures)

2 The Logic of Quantified Statements (1 lecture)

3 Elementary Number Theory and Methods of Proof (1 lecture)

4 Sequences and Mathematical Induction / Recursion (2 lectures)

5 Set Theory / Functions (1 lecture)

6 Counting and Probability (2 lectures)

7 The Efficiency of Algorithms (1 lecture)

9 Graphs / Trees (1 lecture)