| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Discrete Mathematical Structures | CE215 | 3. Semester | 3 + 0 | 3.0 | 4.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 |
| Instructors |
Şeyhmus YILMAZ |
| 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 |
| 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 |
