Class foto courtesy by J. Zatkovich and D. Betancourt (Obtain a full resolution version here)

Course Description

The course is an introduction on Discrete Mathematics oriented toward Computer Science. Roughly it is divided into the following thirds:

1. Sets, Subsets and basic counting
2. Combinatorial tools: induction, pigeonholes, recursion
3. Graph theory

Rigorous reasoning is emphasized.
There are no prerequisites for this course.

Meetings

Tuesday and Thursday, 2:00-3:30pm in MCS B33 (Lecture)
Friday 11:00am - 12:00 pm in MCS B33 (Discussion session)
             3:00pm -  4:00 pm in MCS B31 (Discussion session)

Staff

Ilir Capuni                     (Instructor)
Office hours: Tue 4.30pm-6pm (in PSY 225 )
                    Wed 1pm-2.30pm (in PSY 225 )

New office hours for the examination period: every day from 12.30pm-3.00pm
 

Bhavana Kanukurthi     (TF)
Office hours: Wed 3:30pm-4.30pm (in PSY 221)
                     Fri 1:00pm-3.00pm (in PSY 221)

Textbook

Lovász, Pelikán, Vesztergombi: Discrete Mathematics. Springer 2003, ISBN 978-0-387-95585-8

Exams

The midterm: 03/05, in class
The final:        Thur. 5/7 9-11:00am MCS B33