Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
MAT 608GRAPH AND COMBINATORICS 3 + 02nd Semester7,5

COURSE DESCRIPTION
Course Level Master's Degree
Course Type Elective
Course Objective It is to give information about how to use the concepts of graph theory in solution techniques and to produce solutions to the many current problems that can be encountered in daily life.
Course Content Recurrence and counting rules, definition of graph, edge and vertex, tree and forest definition, connectedness of graph, graph types, matrices representation of graph , algorithms, isomorphic graphs and algebraic structure of graphs, application of graph to daily life problems.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Knows definitions of graph and subgraph.
2Says concepts of Euler and Hamilton graphs.
3Displays the edges of the graph with a matrix.
4Understands connectivity of graph and types.
5Learns information about convex polyhedras.
6Tries to apply graph some daily life problems.
7Knows graph algorithms.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08
LO 00144 4    
LO 0025  5 4 4
LO 003 4 5 4  
LO 00454 4 45 
LO 0055 4 4 4 
LO 006 4 45 4 
LO 0074 5  4 5
Sub Total2316922916139
Contribution32131221

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14798
Assignments155
Mid-terms11515
Final examination13535
Total Work Load

ECTS Credit of the Course






195

7,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Spring1MURAT BEŞENK
Details 2018-2019 Spring1MUSTAFA AŞCI


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
MAT 608 GRAPH AND COMBINATORICS 3 + 0 1 Turkish 2021-2022 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. MURAT BEŞENK mbesenk@pau.edu.tr FEN A0313 %
Goals It is to give information about how to use the concepts of graph theory in solution techniques and to produce solutions to the many current problems that can be encountered in daily life.
Content Recurrence and counting rules, definition of graph, edge and vertex, tree and forest definition, connectedness of graph, graph types, matrices representation of graph , algorithms, isomorphic graphs and algebraic structure of graphs, application of graph to daily life problems.
Topics
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes