Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
MAT 377GRAPH THEORY3 + 05th Semester5,5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective To give information about how to use the concepts of graph theory in solution techniques of many current problems in mathematical structures and computer science.
Course Content Definitions and examples of graphs, tree and forest definition, graph connectivity,, graph types, application of graph to everyday problems, algorithms, isomorphic graphs and graph algebraic structure.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Knows the definition of graph.
2In graph says the concepts of tree and forest.
3Understands connectedness of graph.
4Learns the types of graphs.
5Graphing tries to apply some daily life problems.
6Knows graph algorithms.
7Learns the definition of isomorphic graph.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10
LO 001       5  
LO 002 4      4 
LO 003       44 
LO 004 43  355  
LO 005       45 
LO 006  3    54 
LO 0073 3 44  5 
Sub Total389 4752322 
Contribution0110111330

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

ECTS Credit of the Course






143

5,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2021-2022 Summer1MURAT BEŞENK


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
MAT 377 GRAPH THEORY 3 + 0 1 Turkish 2021-2022 Summer
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. MURAT BEŞENK mbesenk@pau.edu.tr FEN A0313 %70
Goals To give information about how to use the concepts of graph theory in solution techniques of many current problems in mathematical structures and computer science.
Content Definitions and examples of graphs, tree and forest definition, graph connectivity,, graph types, application of graph to everyday problems, algorithms, isomorphic graphs and graph algebraic structure.
Topics
WeeksTopics
1 .
2 .
3 .
4 .
5 .
6 .
7 .
8 .
9 .
10 .
11 .
12 .
13 .
14 .
Materials
Materials are not specified.
Resources
ResourcesResources Language
J.M. Aldous and R.J. Wilson, Graphs and Applications, Springer-Verlag.English
Reinhard Diestel, Graph Theory, Springer-Verlag.English
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