Dokuz Eylül University Information Package / Courses Catalog

Description of Individual Course Units

Course Unit Code	Course Unit Title	Type Of Course	D	U	L	ECTS
CME 4422	INTRODUCTION TO GRAPH THEORY	ELECTIVE	2	2	0	6

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR FERIŞTAH DALKILIÇ

Offered to

Computer Engineering

Course Objective

Main goal of this course is to understand graph data structures and current graph search and optimization algorithms; eventually to increase the analytical thinking abilities of students for solving complex engineering problems.

Learning Outcomes of the Course Unit

1	Learn fundamental graph concepts.
2	Learn fundamental graph algorithms.
3	Ability to find the centrality of the graph or a node by various measures.
4	Ability to implement graph structures and use fundamental graph algorithms in software.
5	Ability to apply graph algorithms to real world problems.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week	Subject	Description
1	Introduction to Graph Definitions, Data Structures
2	Breadth and Depth First Search, Topological Sorting
3	Paths, Cycles, and Connectivity
4	Minimum Spanning Tree
5	Shortest Path Algorithms
6	Planar Graphs
7	Graph Coloring
8	General Review
9	Maximum Flow Problem
10	Random Walk Method and Applications
11	Graph Centrality Measures
12	Link Prediction
13	Graph Embedding Problem
14	Project Presentations

Recomended or Required Reading

Textbook:
Introduction To Algorithms, Third Edition, Cormen TH, Leiserson CE, Rivest RL, and Stein C. The MIT Press, 2009.
Supplementary Book:
Graph Theory, Bondy JA and Murty USR, Springer, 2010.

Planned Learning Activities and Teaching Methods

Lectures / Presentation
Guided problem solving
Laboratory exercises
Homeworks

Assessment Methods

SORTING NUMBER	SHORT CODE	LONG CODE	FORMULA
1	MTE	MIDTERM EXAM
2	ASG	ASSIGNMENT
3	FIN	FINAL EXAM
4	FCG	FINAL COURSE GRADE	MTE * 0.25 + ASG * 0.25 + FIN * 0.50
5	RST	RESIT
6	FCGR	FINAL COURSE GRADE (RESIT)	MTE * 0.25 + ASG * 0.25 + RST * 0.50

*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

In-semester studies will be evaluated with a midterm exam and several laboratory / homework activities.
The final exam will cover all course topics.

Assessment Criteria

All the following criteria will be evaluated with exams, homework and laboratory exercises.
1. Learnability of basic concepts will be evaluated with the correct understanding of given problem.
2. Students should able to analyze the complexity of a given algorithm by applying any technique taught in the course.
3. Optimal solution strategies will be asked to find a solution for real-life problems.
4. Producing correct results of programs that developed as solution strategies will be expected.

Language of Instruction

English

Course Policies and Rules

1. Participation is mandatory (%70 theoretical courses and 80% practices)
2. Every cheating attempt will be finalized with disciplinary action.
3. Instructor reserves the right to quizzes. Notes should be added to these examinations, midterm and final exam grades.

Contact Details for the Lecturer(s)

Asst. Prof. Dr. Feriştah DALKILIÇ
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: 0232 3017412
E-mail: feristah@cs.deu.edu.tr

Office Hours

TBA

Work Placement(s)

None

Workload Calculation

Activities	Number	Time (hours)	Total Work Load (hours)
Lectures	14	2	28
Tutorials	14	2	28
Preparations before/after weekly lectures	13	2	26
Preparation for midterm exam	1	12	12
Preparation for final exam	1	12	12
Preparing assignments	4	9	36
Final	1	3	3
Midterm	1	3	3
TOTAL WORKLOAD (hours)			148

Contribution of Learning Outcomes to Programme Outcomes

PO/LO	PO.1	PO.2	PO.3	PO.4	PO.5	PO.6
LO.1	5		3			5
LO.2	5					5
LO.3	5	3	3			4
LO.4			3	5		5
LO.5	4	5	5	4	3	3

COURSE UNIT TITLE

DEGREE PROGRAMMES

Description of Individual Course Units

Offered By

Level of Course Unit

Course Coordinator

Offered to

Course Objective

Learning Outcomes of the Course Unit

Mode of Delivery

Prerequisites and Co-requisites

Recomended Optional Programme Components

Course Contents

Recomended or Required Reading

Planned Learning Activities and Teaching Methods

Assessment Methods

Further Notes About Assessment Methods

Assessment Criteria

Language of Instruction

Course Policies and Rules

Contact Details for the Lecturer(s)

Office Hours

Work Placement(s)

Workload Calculation

Contribution of Learning Outcomes to Programme Outcomes

CONTACT INFORMATION