Syllabus for MATH2103.

1-2 (Discrete Mathematics)

September 23, 2024

Semester and Year of Study: Fall 2024-2025

Type of the course: Required
Prerequisite: None
Language of Instruction: English

Instructors Dr. Öğr. Üyesi Esma Dirican Erdal

Class hours MATH2103.1/ M1M2M3/DMF-410

MATH2103.2/ Th1Th2Th3/DMF-410

Office hours By appointment (via email) Room: AMF-236

E-mail [email protected]

Hanife Kübra KAYA

Teaching Assistant (TA) PS Hours: MATH2103-PS.1: F3, MATH2103-PS.1: F6

[email protected], AMF-237

Course Description: Propositional logic. Truth tables. Logical equivalences. Predicate calculus and
quantifiers. Rules of inference. Proof methods and strategies. Sets. Set Operations. Functions. Sequences and
summations. Divisibility. Modular arithmetic. Mathematical induction and strong induction. Recursive
definitions and structural induction. Basic counting techniques. The pigeonhole principle. Permutations and
combinations. Inclusion-exclusion. Relations. Equivalence relations. Graphs. Trees.

Course Objectives: The aim of the course is to introduce students to the fundamentals of discrete
structures.Discrete Mathematics is fundamental for mathematical thinking, information technologies and
computer sciences. The students learn how to think mathematically, problem solving strategies, mathematical
reasoning. They learn fundamental concepts of information technologies and computer science just like logic,
trees and recursion.

Course Learning Outcomes: Students who pass the course satisfactorily can:

1. understand logical propositions, mathematical reasoning, mathematical theorems

2. follow mathematical proofs;
3. construct mathematical arguments;
4. count or enumerate objects;
5. work with discrete structures;
6. use problem-solving skills;
7. recognize the applications of discrete mathematics to computer science, information technologies.
TEXTBOOK: Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Edition, McGraw-Hill.
(Ayrık Matematik ve Uygulamaları, çeviri: Ömer Akın, Murat Özbayoğlu, Palme Yayıncılık)

Recommended Readings:
• George Polya, How to Solve It, Princeton University Press.
• R.P. Grimaldi, Discrete and Combinatorial Mathematics, Addison-Wesley.
• K. A. Ross, C. R. B. Wright, Discrete Mathematics, 2nd Edition, Prentice Hall.

Lectures: Lectures will be delivered in class (not online). I will use the Blackboard System (Blackboard ->
Announcements) to communicate with you. You should also check your Işık e-mail account on a regular
basis. When you send an email to your instructor you must write your course code and section number
beside your name, surname and student-number by keeping in mind that your instructor gives some other
lectures as well. You are responsible for every announcement made during class or published in Blackboard.
Not attending the class or not following your e-mails regularly is not an excuse in case you miss something.

Feel free to ask a question to your instructor in and out of class. If you were unable to raise your question
during the class, you can take an appointment from your instructor via email and discuss it.

Attendance: The minimum level of attendance at classes is 70%. Attendance will be monitored and any
absences can be justified by a valid, documented cause. Those who fail to comply with attendance
requirements will not be able to pass this course.

Homework: I will provide questions as non-graded homework and you are advised to use them as a way of
practice.

Exams: There will be two midterm exams and a final exam which are in-class exams. The classroom in which
you are to take an exam will be determined according to your names and announced in Blackboard. Make sure
that you take the exam in the correct classroom. Do not forget to bring your Işık identification card to the
exam. You are to write your name and your Math2104 row number on each exam sheet, with a pen. Use a
pencil for writing your answers. Dictionaries, calculators, smart watches and cell phones are not permitted
in any exam.

Make-up: Any student who misses one of the midterm exams due to a valid excuse will have to provide the
relevant document (e.g. medical report) within one week. Only these students will be eligible for a make-up
exam. The students cannot request a make-up exam more than once in the course of the semester. The
make-up exam will replace the midterm exam the student has missed. The exact time of make-up exam will be
announced later.
Grading: The weights of exams are as follows:

Exams Percent (%) Date

Midterm Exam-I 25% On November 5 @17:15

Midterm Exam-II 30% On December 17 @17:15

Final 45% To be announced later by the Student Office

Academic Integrity and Conduct:

Each student in this course is expected to abide by the Işık University Code of Honor (available
at http://www.isikun.edu.tr/en/university, please read it) and to show due respect to the instructor and the course
assistants. Violation of the integrity principles and any disrespect will not be tolerated.

Assessment procedures: At the end of the semester, students are strongly recommended to complete the
Course Evaluation Survey in Blackboard System to help the instructor assess the course and to improve
teaching quality. The survey form is anonymous, includes questions about instructor, course and student and
takes no more than 8-10 minutes to fill.

Week Dates Sections Topics

Counting: The Basics of Counting, The Pigeonhole Principle.

1 Sep. 23-27 6.1,6.2

Permutations and Combinations, Inclusion-Exclusion.

2 Sep. 30- Oct. 4 6.3

Fundamentals of Logic : Propositional Logic, Connectives,

3 Oct. 7-Oct 11 1.1,1.2,1.3 Propositional Equivalences.

Rules of Inference.
4 Oct. 14-18 1.6
 Predicates and Quantifiers
5 Oct. 21-25 1.4,1.5

Nested Quantifiers.
5 Oct. 28- Nov. 01 1.7,1.8

The Proof Methods and Strategy.

6 Nov. 4-8 5.1,5.2,5.3 MIDTERM-I On November 5

7 Nov.11-15 Fall Semester Midterm Break

Induction and Recursion: Mathematical Induction, Strong

2.1,2,2,2.3,
8 Nov.18-22 Induction, Recursive Definitions, and Structural Induction.
2.4,2.5

Basic Structures: Sets and Set Operations.

9 Nov.25-29 4.1,4.3,4.6

Basic Structures: Functions.

10 Dec.2-6 4.1

Basic Structures: Sequences, Summations, and Matrices.

11 Dec. 9-13 4.3,4.6

MIDTERM-II on December 17

Number Theory and Cryptography: Divisibility and Modular

12 Dec. 16-20 2.2,9.1,9.3 Arithmetic. Primes and Greatest Common Divisors,
Cryptography.

Relations: Relations and Their Properties, Representing

9.5,10.1,
13 Dec. 23-27 10.2, 10.3 Relations. Equivalence Relations.

An Introduction to Graph Theory: Graphs, Graph Terminology

and Special Types of Graphs. Representing Graphs and Graph
11.1,11.2,
14 Dec 30- Jan. 3 Isomorphism. Trees: Introduction to Trees, Applications of
13.1,13.2
Trees.