| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Discrete Mathematics | YZM202 | Compulsory | Bachelor's degree | 2 | Spring | 5 |
Name of Lecturer(s)
Assistant Prof. Dr. Mehmet Ali ALTUNCU
Associate Prof. Dr. Orhan AKBULUT
Associate Prof. Dr. Selda ÇALKAVUR
Associate Prof. Dr. Hülya KODAL SEVİNDİR
Associate Prof. Dr. Alev MUTLU
Assistant Prof. Dr. Levent BAYINDIR
Assistant Prof. Dr. İrfan KÖSESOY
Lecturer Mevlüt SEVİNDİR
Learning Outcomes of the Course Unit
1) The student will learn the basics of creating a mathematical model.
2) The student will learn mathematical concepts and terminology.
3) The student will learn the basics of creating a mathematical model.
4) The student will understand how to use different types of discrete structures.
5) The student will know how to perform mathematical proofs.
Program Competencies-Learning Outcomes Relation
| Program Competencies | |||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | ||
| Learning Outcomes | |||||||||||||
| 1 | High | Middle | Low | Low | Low | Low | Low | Middle | Low | Low | Low | Low | |
| 2 | High | Middle | Low | Low | Low | Low | Low | Middle | Low | Low | Low | Low | |
| 3 | High | Middle | Low | Low | Low | Low | Low | Middle | Low | Low | Low | Low | |
| 4 | High | High | Low | Low | Low | Low | Low | Middle | Low | Low | Low | Low | |
| 5 | High | Middle | Low | Low | Low | Low | Low | Middle | Low | Low | Low | Low | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
-
Course Contents
This lesson covers;propositions, proof techniques. algorithms, complexity notion in algorithms, asymptotic notations (Big Oh, Little Oh, Omega, Theta), counting, Pigeonhole Principle, modeling and solution techniques for recursive relations, divide and conquer, graphs, trees and related algorithms and state machines.
Weekly Schedule
1) Propositions, logical statements2) Logical statements, proof methods
3) Algorithms, complexity and asymptotic notations (O, o, /omega, /theta)
4) Asymptotic notations (O, o, /omega, /theta)
5) Counting, Pigeon Hole Principle
6) Recursive functions
7) Modelling using recursive functions (Hanoi tower problem etc.)
8) Midterm examination/Assessment
9) Solving recursive equations
10) Solving recursive equations
11) Relational Database Management System
12) Graphs, trees and basic algorithms
13) Graphs, trees and basic algorithms
14) Finite state machines
15) Finite state machines
16) Final examination
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Lecture
2) Lecture
3) Question-Answer
4) Question-Answer
5) Question-Answer
6) Question-Answer
7) Question-Answer
8) Discussion
9) Discussion
10) Drill and Practice
11) Drill and Practice
12) Drill and Practice
13) Drill and Practice
14) Drill and Practice
15) Self Study
16) Problem Solving
17) Problem Solving
18) Problem Solving
19) Problem Solving
20) Problem Solving
Assessment Methods and Criteria
Contribution of Midterm Examination to Course Grade |
50% |
|---|---|
Contribution of Final Examination to Course Grade |
50% |
Total |
100% |
Language of Instruction
English
Work Placement(s)
Not Required