|
YZM2008 | Discrete Mathematics | 2+1+0 | ECTS:4 | Year / Semester | Spring Semester | Level of Course | First Cycle | Status | Compulsory | Department | DEPARTMENT of SOFTWARE ENGINEERING | Prerequisites and co-requisites | None | Mode of Delivery | Face to face | Contact Hours | 14 weeks - 2 hours of lectures and 1 hour of practicals per week | Lecturer | Dr. Öğr. Üyesi Eyüp GEDİKLİ | Co-Lecturer | | Language of instruction | Turkish | Professional practise ( internship ) | None | | The aim of the course: | Objects studied in discrete mathematics are largely countable sets such as integers, finite graphs, and formal languages. The aim of this course is to teach mathematical basics of computer applications. |
Learning Outcomes | CTPO | TOA | Upon successful completion of the course, the students will be able to : | | | LO - 1 : | describe mathematical basics of computer science and fundamental concepts of discrete systems
describe mathematical basics of computer science and fundamental concepts of discrete systems | 1,2,3,4 | 1,3 | LO - 2 : | apply mathematical methods to computer science related and other engineering problems | 1,2,3 | 1,3 | LO - 3 : | describe combinatorical computation principles | 1,2,3,4 | 1,3 | LO - 4 : | use graph theory in modeling of discrete systems. | 1,2,3,4 | 1,3 | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | |
Logic and Proofs. Enumerative combinatorics. Recurrence Relations. Graph Theory, Representing graphs. The 4-color problem. Boolean Algebra and Combinatorial Circuits. Sets. Formal systems. Hamilton and Euler loops. Counting and relations. |
|
Course Syllabus | Week | Subject | Related Notes / Files | Week 1 | Introduction. Sets and Relations | | Week 2 | Models. relations and Their properties. Representing Relations | | Week 3 | Boolean algebra. Boolean Functions Properties. | | Week 4 | Completenesss. | | Week 5 | Boole Function Applications. Minimization of Circuits | | Week 6 | Introduction to Graphs | | Week 7 | Representing Graphs and Graph Izomorphism | | Week 8 | Connectivity | | Week 9 | Mid-term exam | | Week 10 | Euler and Hamilton Paths | | Week 11 | Graf Coloring | | Week 12 | Shortest Path Problems. Planar Graphs | | Week 13 | short exam | | Week 14 | Application problems | | Week 15 | Characterization. Forbidden figurs | | Week 16 | End-of-term exam | | |
1 | Discrete Mathematics, Richard Johnsonbaugh, Prentice-Hall, 2001. | | |
1 | Discrete and Combinational Mathematics, Ralph.P. Grimaldi, An Applied Introduction, Addison-Wesley, 1998. | | |
Method of Assessment | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | Mid-term exam | 9 | | | 50 | End-of-term exam | 16 | | | 50 | |
Student Work Load and its Distribution | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | Yüz yüze eğitim | 3 | 14 | 42 | Sınıf dışı çalışma | 2 | 14 | 28 | Arasınav için hazırlık | 10 | 1 | 10 | Arasınav | 2 | 1 | 2 | Kısa sınav | 2 | 1 | 2 | Dönem sonu sınavı için hazırlık | 14 | 1 | 14 | Dönem sonu sınavı | 2 | 1 | 2 | Total work load | | | 100 |
|