Course Information


Course Information
Course Title Code Semester L+U Hour Credits ECTS
DISCRETE STRUCTURES YMH219 3. Semester 3 + 0 3.0 3.0

Prerequisites None

Language of Instruction Turkish
Course Level Bachelor's Degree
Course Type Compulsory
Mode of delivery
Course Coordinator
Instructors Murat KARAKUŞ
Assistants
Goals This course is designed for the students how to think logically and mathematically, as well as practice fundamental techniques for solving problems in computer science.
Course Content Logic, Set Theory, Relations, Functions, Combinatorics, Graph Theory, Boolean Algebra
Learning Outcomes 1) Develop a formal argument using logical notions and verify whether the argument is valid or not
2) Understand the structures of basic proof techniques in mathematics
3) Apply the basic counting techniques in solving combinatorial problems
4) Comprehend the basic mathematical objects such as sets, functions, and relations, specify the mathematical properties that these objects
5) Analyze problems in computer science using graphs and trees

Weekly Topics (Content)
Week Topics Teaching and Learning Methods and Techniques Study Materials
1. Week Foundations Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
2. Week Fundamentals of Logic Lecture; Problem Solving; Discussion

Problem Based Learning 		Homework Presentation (Including Preparation Time)
3. Week Set Theory Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
4. Week Discrete Probability Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
5. Week Mathematical Proofs Lecture; Problem Solving

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

Problem Based Learning 		Homework Presentation (Including Preparation Time)
7. Week Counting Techniques II Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
8. Week Algorithms Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
9. Week Midterm Lecture; Problem Solving

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

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

Problem Based Learning 		Homework Presentation (Including Preparation Time)
12. Week Graph Theory Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
13. Week Graph Theory II Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)
14. Week Boolean Algebra Lecture; Problem Solving

Problem Based Learning 		Homework Presentation (Including Preparation Time)

Sources Used in This Course
Recommended Sources
Discrete and Combinatorial Mathematics: An Applied Introduction, Ralph P. Grimaldi, Pearson, 2003.
Discrete Structures and its Applications, Kenneth Rosen, McGraw-Hill Education, 7th edition, 2011.

Relations with Education Attainment Program Course Competencies
Program RequirementsContribution LevelDK1DK2DK3DK4DK5
PY1500000
PY2500000
PY3500000
PY4500000

*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) 10 2
Homework 5 10
Midterm Exam 1 14
Final Exam 1 20
Total Workload
Total Workload / 30 (s)
ECTS Credit of the Course
Quick Access Hızlı Erişim Genişlet
Course Information
  • Course Information
  • Weekly Topics (Content)
  • Sources Used in This Course
  • Relations with Education Attainment Program Course Competencies
  • ECTS credits and course workload