Spring 2017

This course is an introduction to the area of Discrete Mathematics. The word "discrete" should be understood in the sense that the mathematical objects which we will be studying are not continuous. This is an extremely broad area within mathematics and we will only provide an introduction to a select few topics (listed below). All of the topics which we shall cover are fundamental for both computer science and mathematics.

- Logic and Proofs
- Naive Set Theory
- Mathematical Induction and Recursion
- Combinatorics
- Relations
- Graph Theory

Dr. Vladimir Zamdzhiev

Office hours: WF 11:00am - 12:00 noon, Stanley Thomas 314 and by appointment

Email: vzamdzhi {at} tulane {dot} edu

Selcuk Karakoc

Office hours: T 1:00pm - 2:00pm, Gibson Hall 305 and by appointment

E-mail: skarakoc {at} tulane {dot} edu

**Lecture:**MWF 02:00pm - 02:50pm, Stanley Thomas 302**Lab:**R 12:30pm - 01:45pm Gibson 325

- Homework - 30%
- Quizzes - 10%
- Midterm - 25%
- Final - 35%

Grades will be posted on Canvas. The weighted average will determine your letter grade as follows:

A >= 90%; B >= 80%; C >= 70%; D >= 60%; F < 60%

There will be 12 quizzes in total. Quizzes will take place during the labs. The two lowest scoring quizzes will be dropped when determining your grade. No make-up quizzes are allowed.

In addition, there will also be a midterm and a final exam. The final exam will cover all topics of the course. The midterm exam will cover only the material which we have discussed in class prior to it.

Missing any exam or quiz will result in a grade of zero for it. A request for a make-up exam must be given to the instructor prior to the exam date (documentation may be required).

All exams (including quizzes) will be **closed book**.

The midterm exam is scheduled for **Thursday, March 9, 2017, 12:30pm - 01:45pm, Gibson 325**.

The final exam is scheduled for **Friday, May 5, 2017, 08:00am - 10:30am, Stanley Thomas 302**.

There will be homework assignments almost every week. Assignments are due at the beginning of the lab session the week after they are posted. Some homework assignments will have optional (more difficult) problems which can be solved to improve your overall grade. Homework assignments will be posted on the course webpage one week before they are due. The solutions to the homework assignments must be your own work. Handing in late homework is not allowed, except if you have a valid reason which must be communicated to the instructor before the due date of the assignment.

Homework Assignment 1 (Due Thursday January 26)

Homework Assignment 2 (Due Thursday February 2)

Homework Assignment 3 (Due Thursday February 9)

Homework Assignment 4 (Due Thursday February 16)

Homework Assignment 5 (Due Thursday February 23)

Homework Assignment 6 (Due Thursday March 2)

Homework Assignment 7 (Due Thursday March 23)

Homework Assignment 8 (Due Thursday April 6)

Homework Assignment 9 (Due Thursday April 13)

Homework Assignment 10 (Due Thursday April 20)

Homework Assignment 11 (Due Thursday April 27)

Practice final (with solutions)

Attendance in the lecture is not mandatory, but it is strongly encouraged. Students are responsbile for identifying the material presented during the lectures. Attendance in the labs is mandatory.

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition, McGraw-Hill, 2012

The course is subject to Tulane's Code of Academic Conduct. You are encouraged to discuss the course material with other students, but anything which you submit for grading must be your own work. You are not allowed to read, copy, or rewrite the solutions written by others (in this or previous terms or from the web). You are also not allowed to share your solutions with others. Cheating, plagiarism and other violations will be reported to the Dean's office.