Course Information


Course Information
Course Title Code Semester L+U Hour Credits ECTS
MATHEMATICS AND LOGIC SGM107 1. Semester 3 + 0 3.0 4.0

Prerequisites None

Language of Instruction English
Course Level Associate's Degree
Course Type Compulsory
Mode of delivery
Course Coordinator
Instructors Muhammed Saadetdin KAYA
Assistants
Goals Logic and discrete mathematics play a critical role in the field of cybersecurity, and the primary objective of this course is to introduce students to fundamental logic and discrete structures essential for cybersecurity. This course aims to equip students with mathematical thinking, information technology, and computer science knowledge focused on cybersecurity. Topics such as Logic, Proof Techniques, Sets, Relations, Functions, Counting, and Graph Theory will be covered. Through this course, students will gain the ability to effectively utilize mathematical approaches to understand cyber-attacks and develop cybersecurity measures.
Course Content Sets, Functions, Relations, Counting Techniques, Permutation, Combination, Classical Probability, Sequences, Logic, Graphs and Trees, Coloring
Learning Outcomes 1) Grasp fundamental concepts related to set theory, functions, and solve relevant problems
2) Comprehend fundamental concepts in combinatorics, such as permutation, combination, and counting, and solve problems related to these topics.
3) Apprehend the basic concepts of Graph Theory, solve relevant problems, and apply this knowledge.

Weekly Topics (Content)
Week Topics Teaching and Learning Methods and Techniques Study Materials
1. Week Clusters Lecture; Question Answer

Problem Based Learning
Homework Presentation (Including Preparation Time)
2. Week Functions Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
3. Week Relations Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
4. Week Counting Techniques Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
5. Week Permutation, Combination Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
6. Week Classical Probability Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
7. Week Sequences Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
8. Week Arithmetic and Geometric Sequences Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
9. Week Midterm Exam, Universal Quantification Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
10. Week Logic, Logics Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
11. Week Propositional Logic Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
12. Week Graphs and Trees Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
13. Week Planar Graphs Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)
14. Week Coloring Lecture; Question Answer; Problem Solving

Problem Based Learning
Homework Presentation (Including Preparation Time)

Sources Used in This Course
Recommended Sources
Discrete Mathematics, An Open Introduction, Oscar Levin
Kenneth H. Rosen, Discrete Mathematics and Its Applications, Fifth Edition, McGraw-Hill.
R.P. Grimaldi, Discrete and Combinatorial Mathematics, Addison-Wesley.

Relations with Education Attainment Program Course Competencies
Program RequirementsContribution LevelDK1DK2DK3
PY15555
PY25555
PY35000
PY45000
PY55000

*DK = Course's Contrubution.
0 1 2 3 4 5
Level of contribution None Very Low Low Fair High Very High
.

ECTS credits and course workload
Event Quantity Duration (Hour) Total Workload (Hour)
Course Duration (Total weeks*Hours per week) 14 3
Work Hour outside Classroom (Preparation, strengthening) 14 4
Midterm Exam 1 2
Time to prepare for Midterm Exam 1 6
Final Exam 1 2
Time to prepare for Final Exam 1 12
Total Workload
Total Workload / 30 (s)
ECTS Credit of the Course
Quick Access Hızlı Erişim Genişlet
Course Information