Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
4MMT240Discrete Mathematics3+0+03518.02.2026

 
Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Computer Engineering
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The aim of this course is to teach discrete mathematics topics that form the mathematical foundations of computer applications, including propositional logic, proof techniques, set theory, Cartesian products, relations, functions, counting techniques, number theory, graph theory, trees, and Boolean algebra; and to develop students’ mathematical thinking, abstraction, and analytical problem-solving skills. In addition, within the scope of an introduction to cryptology, the course aims to provide a fundamental background in information security by introducing number-theory-based cryptographic concepts, and to enable students to apply discrete mathematical concepts to computer science problems in an integrated manner through project work.
Course Content Propositional logic and logical inference; proof techniques; set theory and basic set operations; Cartesian products, relations, and functions; fundamental concepts and applications of number theory; an introduction to cryptography and basic cryptographic concepts; counting techniques, permutations, and combinations; graph theory, basic graph concepts and applications; tree structures; Boolean algebra and its relationship to logical circuits.
Course Methods and Techniques 1. Narration
2. Question and Answer
3. Discussion
4. Practice and Application
5. Problem Solving
Prerequisites and co-requisities None
Course Coordinator Asist Prof. Fatma Zehra UZEKMEK
Name of Lecturers Asist Prof. Fatma Zehra UZEKMEK
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Kenneth H. Rosen (2019), Discrete Mathematics and Its Applications (8th Edition, McGraw-Hill Education)
Exams 1 Ara Sınav, 1 Ödev, 1 Final Sınavı

Course Category
Mathematics and Basic Sciences %100
Engineering %25
Engineering Design %0
Social Sciences %0
Education %0
Science %0
Health %0
Field %25

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
Mid-terms 1 % 35
Assignment 1 % 25
Final examination 1 % 40
Total
3
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 3,5 49
Assignments 1 15,5 15,5
Mid-terms 1 10 10
Final examination 1 10 10
Total Work Load   Number of ECTS Credits 5 126,5

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Temel ayrık matematik konularını (önermeler mantığı, ispat yöntemleri, küme teorisi, bağıntılar, fonksiyonlar ve sayı teorisi) öğrenir; soyut, analitik ve sistematik düşünme becerilerini kullanarak bu alanlara ilişkin problemleri uygun matematiksel yöntemlerle çözer ve ispatlar.
2 Kriptografi, sayma teknikleri, permütasyon ve kombinasyon, graf teorisi, ağaçlar ve Boole cebri kapsamında ele alınan kavramların matematiksel ve algoritmik yapılarını açıklar; analitik ve sistematik düşünme becerilerini kullanarak ayrık sistemleri modeller, verilen problemlere uygun çözüm yaklaşımları geliştirir ve analiz eder.
3 Ayrık matematiksel kavram ve yöntemleri temel mühendislik bakış açısıyla bilgisayar bilimi problemlerine aktarır; matematiksel modeller kurar, algoritmik çözümler geliştirir ve bu çözümleri farklı konuların bütünleşik kullanımını gerektiren proje çalışmaları kapsamında uygular.

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Propositional logic
2 Proof methods
3 Set Theory
4 Cartesian product, relations
5 Functions
6 Number theory fundamentals I - Division algorithm
7 Number theory fundamentals II - solving congruence, Fermat's little theorem, Wilson's theorem
8 MİDTERM EXAM
9 Cryptology
10 Counting, permutation, combination
11 Graph theory, the general concepts of graph, isomorphism, Euler and Hamilton paths
12 Trees, Boolean algebra
14 Homework presentations
15 FİNAL EXAM

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11
All 5
C1 5
C2 5
C3 5 5

  bbb

  
  https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=243205&curProgID=5607&lang=en