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

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 536	CONSEPT OF DISTANCE IN GRAPHS AND ALGORITHMS	3 + 0	2nd Semester	7,5

COURSE DESCRIPTION

Course Level	Master's Degree
Course Type	Elective
Course Objective	The aim of this course, to teach consept of distance in graphs and to examine algoritmic solution of problems based on distance modeled with graphs.
Course Content	Path and connectedness, Eccentricity value of a vertex and center of graphs, Self-centered graphs, Incides and distance matrices, applications of distance matrices, Symetric graphs and distance, Distance distributions, Independence set problems and algoritmic solutions, Covering set problems and algoritmic solutions, Domination set problems and algoritmic solutions. Closeness measurements and algorithms in networks.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.

COURSE LEARNING OUTCOMES

1	Defines measures of distance in graphs.
2	Writes distance algorithms in graphs.
3	Solves the problems of optimization depending on the distance.
4	Expresses independence set, covering set and domination set problems.
5	Defines closeness measurements in networks.

COURSE'S CONTRIBUTION TO PROGRAM

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	3	42
Mid-terms	1	21	21
Final examination	1	40	40
Report / Project	1	50	50
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