Türkçe | English
OF FACULTY of TECHNOLOGY / DEPARTMENT of SOFTWARE ENGINEERING

Course Catalog
http://www.ktu.edu.tr/ofyazilim
Phone: +90 0462 3778353
OFTF
OF FACULTY of TECHNOLOGY / DEPARTMENT of SOFTWARE ENGINEERING /
Katalog Ana Sayfa
  Katalog Ana Sayfa  KTÜ Ana Sayfa   Katalog Ana Sayfa
 
 

YZM2008Discrete Mathematics2+1+0ECTS:4
Year / SemesterSpring Semester
Level of CourseFirst Cycle
Status Compulsory
DepartmentDEPARTMENT of SOFTWARE ENGINEERING
Prerequisites and co-requisitesNone
Mode of DeliveryFace to face
Contact Hours14 weeks - 2 hours of lectures and 1 hour of practicals per week
LecturerDr. Öğr. Üyesi Eyüp GEDİKLİ
Co-Lecturer
Language of instructionTurkish
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 OutcomesCTPOTOA
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,41,3
LO - 2 : apply mathematical methods to computer science related and other engineering problems1,2,31,3
LO - 3 : describe combinatorical computation principles1,2,3,41,3
LO - 4 : use graph theory in modeling of discrete systems. 1,2,3,41,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

 
Contents of the Course
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
 WeekSubjectRelated Notes / Files
 Week 1Introduction. Sets and Relations
 Week 2Models. relations and Their properties. Representing Relations
 Week 3Boolean algebra. Boolean Functions Properties.
 Week 4Completenesss.
 Week 5Boole Function Applications. Minimization of Circuits
 Week 6Introduction to Graphs
 Week 7Representing Graphs and Graph Izomorphism
 Week 8Connectivity
 Week 9Mid-term exam
 Week 10Euler and Hamilton Paths
 Week 11Graf Coloring
 Week 12Shortest Path Problems. Planar Graphs
 Week 13short exam
 Week 14Application problems
 Week 15Characterization. Forbidden figurs
 Week 16End-of-term exam
 
Textbook / Material
1Discrete Mathematics, Richard Johnsonbaugh, Prentice-Hall, 2001.
 
Recommended Reading
1Discrete and Combinational Mathematics, Ralph.P. Grimaldi, An Applied Introduction, Addison-Wesley, 1998.
 
Method of Assessment
Type of assessmentWeek NoDate

Duration (hours)Weight (%)
Mid-term exam 9 50
End-of-term exam 16 50
 
Student Work Load and its Distribution
Type of workDuration (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 load100