| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Discrete Mathematical Structures | BM217 | 3. Semester | 3 + 0 | 3.0 | 3.0 |
| Prerequisites | None |
| Language of Instruction | Turkish |
| Course Level | Undergraduate |
| Course Type | |
| Mode of delivery | Face to face |
| Course Coordinator |
Assist. Prof. Dr. Sultan ZAVRAK Res. Assist. Tunahan TİMUÇİN |
| Instructor(s) | |
| Assistants | |
| Goals | To learn how to prove simple logical claims. To learn how to show the correctness of simple algorithms. To learn how to construct correct logical claims and algorithms. To learn how to work with the discrete structures such as graphs, trees, sets. |
| Course Content | Logic and Proofs, Sets, Functions, Matrices, Sequences, Sums, Algorithms, Number Theory, Graphs, Graph Algorithms, Trees, Minimum Spanning Trees, Induction, Relations |
| Learning Outcomes |
- Students will be able to prove simpe logical claims. - Students will be able to show the correctness of simple algorithms. - Students will be able to construct correct logical claims and algorithms. - Students will be able to work with the discrete structures such as graphs, trees, sets. |
| Week | Topics | Learning Methods |
|---|---|---|
| 1. Week | Logic and Proofs | |
| 2. Week | Logic and Proofs | |
| 3. Week | Logic and Proofs | |
| 4. Week | Sets | |
| 5. Week | Functions, Matrices, Sequences, Summations | |
| 6. Week | Algorithms | |
| 7. Week | Algorithms | |
| 8. Week | Number Theory | |
| 9. Week | Graphs | |
| 10. Week | Graph Algorithms | |
| 11. Week | Trees | |
| 12. Week | Minimum Spanning Trees | |
| 13. Week | Mathematical Induction | |
| 14. Week | Relations |
| Ayrık Matematik ve Uygulamaları, Kenneth H. Rosen, Çevirmenler: A. Murat Özbayoğlu , Ömer Akın, Yayınevi: Palme Yayınevi - Akademik Kitaplar ISBN: 9786053553571 |
| Program Requirements | Contribution Level | DK1 | DK2 | DK3 | DK4 | Measurement Method |
|---|---|---|---|---|---|---|
| PY1 | 3 | 0 | 0 | 0 | 0 | - |
| PY2 | 4 | 0 | 0 | 0 | 0 | - |
| PY3 | 3 | 0 | 0 | 0 | 0 | - |
| PY4 | 3 | 0 | 0 | 0 | 0 | - |
| PY5 | 4 | 0 | 0 | 0 | 0 | - |
| PY6 | 4 | 0 | 0 | 0 | 0 | - |
| PY7 | 3 | 0 | 0 | 0 | 0 | - |
| PY8 | 3 | 0 | 0 | 0 | 0 | - |
| PY9 | 3 | 0 | 0 | 0 | 0 | - |
| PY10 | 4 | 0 | 0 | 0 | 0 | - |
| 0 | 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|---|
| Course's Level of contribution | None | Very Low | Low | Fair | High | Very High |
| Method of assessment/evaluation | Written exam | Oral Exams | Assignment/Project | Laboratory work | Presentation/Seminar |
| Event | Quantity | Duration (Hour) | Total Workload (Hour) |
|---|---|---|---|
| Course Hours | 14 | 3 | 42 |
| Midterm 1 | 1 | 2 | 2 |
| Homework 1 | 1 | 21 | 21 |
| Homework 2 | 1 | 21 | 21 |
| Final | 1 | 2 | 2 |
| Practice | 1 | 10 | 10 |
| Classroom Activities | 1 | 30 | 30 |
| Total Workload | 128 | ||
| ECTS Credit of the Course | 3.0 | ||
