Fall, 2014 - 2015

Wed., 12:40 14:30

Thu., 9:40 10:30 (may start earlier for
exams, notice will be given)

MATH 112
Discrete Mathematics

Instructors: M. Reha Civanlar (c. 510, o. 609)

Gonca Grsun
(c. 238, o. 204)
Kerem Kakalolu (c. 233, o. 202)
TA: To be announced
All classes (c) and offices (o) are at SoE (AB1)
E-Mail: reha.civanlar@ozyegin.edu.tr
gonca.gursun@ozyegin.edu.tr
kerem.kaskaloglu@ozyegin.edu.tr
Office Hours: By appointment

Overview

Materials

This course aims building the mathematical background required for computer
applications and explaining mathematical modeling with examples. Topics
covered include counting theory, set theory, mathematical induction, Boolean
algebra, modular arithmetic, number theory, graphs and tree structures, and
matching.

Textbook: Discrete Mathematics:

Elementary and Beyond by L. Lovsz, J.
Pelikn, K. Vesztergombi, Springer, 2003

Goals

Course slides will be made available

on LMS after the class.

To be able to build mathematical models for understanding and solving

complex problems. After successful completion of the course, the learner is
expected to be able to:
1.
Solve advanced mathematical problems and make proofs
2.
Make logic propositions and mathematical inductions
3.
Recognize and apply sets, number theory, graphs
4.
Apply discrete mathematics to areas such as cryptography

Other Resources

Other material may be assigned

during the class.

Activities
In class interactive exercises, assignments for out-of-class study, several tests.

Evaluation
Based on test results only. There will be 7 in-class tests, out of which the 6 best
grades will be averaged. There will be questions from the assignments in the
exams. Solving these correctly will guarantee receiving a C- grade.

Make-Up Policy
There will be no make-up tests. The lowest grade from the 7 in-class tests will
be dropped; so missing a test may not have an effect on the overall
performance.

Discrete Mathematics

Academic Honesty
Honesty and trust are important to all of us as individuals. Students and faculty adhere to the following principles of academic
honesty at zyein University:

Individual accountability for all individual work, written or oral: Copying from others or providing answers or
information, written or oral, to others during exams is cheating.
Providing proper acknowledgment of original author: Copying from another student's paper or from another text
without written acknowledgment is plagiarism.
Study or project group activity and authorized teamwork: Unauthorized help from another person or having someone
else write one's paper or assignment is collusion.

Cheating, plagiarism, and collusion are serious offenses and will result in an F grade and disciplinary action.

Tentative Schedule
Week

Date

# class

Tentative Topic

Exams

22-Sep

Counting, Sets

29-Sep

Exam 1

6-Oct

Counting
Binomial Coef., Pascal
Triangle

13-Oct

Boolean Algebra

Exam 2

20-Oct

Induction, Pancakes

27-Oct

Exam 3

3-Nov

Fibonacci Numbers

10-Nov

Generating Functions

Exam 3
Exam 4

17-Nov

Generating Functions

10

24-Nov

Exam 5

11

1-Dec

Modulo & Primes

Applications,
Encryption, Coding

12

8-Dec

Graphs

Exam 6

13

15-Dec

Graphs and Trees

14

22-Dec

Matching

15

29-Dec

Exam 7

16

5-Jan

No classes

Discrete Mathematics

Exam 7