PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
MAT 608	GRAPH AND COMBINATORICS	3 + 0	1st Semester	7,5

COURSE DESCRIPTION

Course Level	Doctorate 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

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

COURSE'S CONTRIBUTION TO PROGRAM

Data not found.

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	3	42
Hours for off-the-classroom study (Pre-study, practice)	14	7	98
Assignments	1	5	5
Mid-terms	1	15	15
Final examination	1	35	35
Total Work Load ECTS Credit of the Course			195 7,5

COURSE DETAILS

Select Year

This course is not available in selected semester.

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student