BİL132

Discrete Mathematics for Computer Scientists

Faculty \ Department
School of Engineering \ Computer Engineering
Course Credit
ECTS Credit
Course Type
Instructional Language
3
6
Compulsory
Turkish
Prerequisites
-
Programs that can take the course
Computer Engineering
Artificial Intelligence Engineering
Course Description
This course aims to provide the comprehensive infrastructure required for the computer engineering undergraduate program. Basic knowledge of Logic and Proofs, Sets, Integers, Reasoning, Induction, Recursion, Algorithm Fundamentals, Counting, Permutation, Combination, Discrete Probability, Advanced Counting Techniques, Functions, Relations and properties are within the scope of the course.
Textbook and / or References
1. Ayrık Matematik ve Uygulamaları, Discrete Mathematics and its applications 7. Baskıdan çeviri. : Ömer Akın, Murat Özbayoğlu, Palme Yayıncılık, 2015
2. Discrete Mathematics and its applications, 5th, 6th veya 7th ed. : Kenneth H. Rosen, McGraw Hill, 2011
Course Objectives
1. Learning the basics of logic and logical inference
2. Learning the basics of sets and functions
3. Learning the mathematical cause-effect relationship and the basics of induction
4. Understanding algorithm and time complexity logic
5. Learning the basics of counting, permutation and combination theorems
6. Learning the basics of recursive structure
7. Learn the basics of relationships and their characteristics
8. Examining counting problems
9. Learning the fundamentals of discrete probability
Course Outcomes
1. Learn mathematical thinking and creating cause-effect relationships
2. Analyze and find solutions to different numbering problems depending on counting methods
3. Gain knowledge about discrete structures (sets, permutations, relations)
4. Know how discrete mathematics applications and models are adapted to Computer Engineering problems
Tentative Course Plan
Week 1: Set Theory
Week 2: Foundations of logic, propositional logic
Week 3: First order logic
Week 4: Logical inference
Week 5: Proof teqniques
Week 6: Functions
Week 7: Fundamentals of induction and recursion
Week 8: Number theory
Week 9: Modular arithmetic
Week 10: Combinations and permutations
Week 11: Discrete Probability
Week 12: Relations
Tentative Assesment Methods
• Midterm 40%
• Final 60%
• Bonus homework or quiz: 10 %(If the total of midterm + Final is 50 %, then it will be taken into account)
Program Outcome *
1 2 3 4 5 6 7 8 9 10 11
Course Outcome
1 A, C
2 A, C, D
3 A, C
4 C, D