| Course Title | Code | Language | Type | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|---|---|
| Discrete Mathematical Structures | CE215 | Turkish | Compulsory | 3. Semester | 3 + 0 | 3.0 | 4.0 |
| Prerequisite Courses | |
| Course Level | Undergraduate |
| Mode of delivery | Face to face |
| Course Coordinator | Dr. Öğr. Üyesi Sultan ZAVRAK |
| Instructor(s) | Dr. Öğr. Üyesi Şeyhmus YILMAZ (Güz) |
| 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 |
| Week | Topics/Applications | Method |
|---|---|---|
| 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 |
| Ders Kitabı veya Notu | Ders Kitabı veya Ders Notu bulunmamaktadır. |
|---|---|
| Diğer Kaynaklar |
|
| Güz Dönemi | |||
| Responsible Personnel | Grup | Evaluation Method | Percentage |
|---|---|---|---|
| Dr. Öğr. Üyesi Şeyhmus YILMAZ | N.Ö | Vize | 40.00 |
| Dr. Öğr. Üyesi Şeyhmus YILMAZ | N.Ö | Final | 60.00 |
| Toplam | 100.00 | ||
