Course Details

Return to Classes
Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
7IE402DISCRETE MATHEMATICS3+0+03515.08.2025

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program INDUSTRIAL ENGINEERING
Type of Program Formal Education
Type of Course Unit Elective
Course Delivery Method Face To Face
Objectives of the Course This course is designed to make students gain abilities of mathematical reasoning,
combinatorial analysis, algorithmic thinking and working with discrete structures. Being able to use mathematical symbols and language correctly and being able to follow mathematical arguments properly are also the expected skills that students should develop by taking this course.
Course Content The course will cover the fundamental mathematical tools used in computer science. These are logic (propositional and predicate), methods of mathematical proofs, sets, functions, algorithms, mathematical induction and counting techniques, pigeonhole principle, selected topics from Elementary Number Theory like modular arithmetic, relations, recurrences, Boolean algebra, Graphs and trees.
Course Methods and Techniques The course will be held in-class. CANVAS will be used for all announcements, course materials. You are responsible to follow the CANVAS regularly. This is also a student-driven course. It is your responsibility to participate actively in class discussions. Evaluation of class participation will be based on your ability to raise and answer important issues, contribute ideas or insights, build upon the ideas of others, ask questions to presenters, etc. By actively participating in the class discussions, you can sharpen your insights. Both the quality and frequency of your participation will count towards your active participation grade. Also, you will not get any class participation points for just being present in class. Class attendance is a necessary but not sufficient condition for scoring highly on class participation.
Prerequisites and co-requisities None
Course Coordinator Asist Prof.Dr. Rukiye Kaya https://avesis.agu.edu.tr/rukiye.kaya rukiye.kaya@agu.edu.tr
Name of Lecturers Asist Prof.Dr. RUKİYE KAYA
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Discrete Mathematics and Its Applications by Kenneth H. Rosen, 8th Edition, McGraw-Hill
Course Notes CANVAS

Course Category
Engineering %100

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Yarıl yılSonu Sınavı/Dönem Projesinin Başarı Notuna Katkısı 1 % 35
Quiz/Küçük Sınav 1 % 20
Ödev 1 % 15
Final examination 1 % 30
Total
4
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Araştırma Ödevi 1 5 5
Yazılı Sınav 1 30 30
Grup Sunumu 1 5 5
Ev Ödevi 1 3 3
Sınıf İçi Aktivitesi 5 1 5
Sunum için Hazırlık 1 3 3
Sunum 1 1 1
Kısa Sınav 2 3 6
Ders dışı çalışma 14 2 28
Takım/Grup Çalışması 3 1 3
Öğretici Sunum/Açıklama 5 1 5
Yüz Yüze Ders 14 3 42
Final Sınavı 1 20 20
Total Work Load   Number of ECTS Credits 5 156

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Understand mathematical arguments involving logical operations and quantifiers
2 Build truth tables for propositional expressions
3 Construct proofs using various methods, including direct proof, proof by contradiction, proof by cases, and mathematical induction.
4 Comprehend the analogy between logic and sets, and perform basic set operations.
5 Solve problems using counting techniques and combinatorics.
6 Apply the pigeonhole principle to solve problems.
7 Test if a given function is one-to-one, onto, or neither.
8 Solve problems involving recurrence relations.
9 Construct circuits corresponding to a given Boolean function.
10 Understand basic definitions related to graphs and trees.

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 The Foundations: Logic and Proofs
2 The Foundations: Logic and Proofs
3 Basic Structures: Sets, Functions
4 Basic Structures: Functions, Sequences, and Sums,
5 Growth of Functions, Number Theory
6 Induction and Recursion
7 Induction and Recursion
8 Fall Break
9 Midterm Exam
10 Counting, Recurrence Relations
11 Recurrence Relations
12 Boolean Algebra
13 Graphs
14 Trees
15 Final exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
C1 4 3 1 2 2
C2 4 3 1 2 2
C3 4 3 1 2 2
C4 4 3 1 2 2
C5 4 3 2 2 2
C6 3 3 1 2 2
C7 4 3 1 2 2
C8 4 3 1 2 2
C9 4 3 1 2 1
C10 3 3 1 2 2 2

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://sis.agu.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=78833&lang=en
Return to Classes