COURSE UNIT TITLE

: GRAPH THEORY AND ALGORITHMS

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSE 5004 GRAPH THEORY AND ALGORITHMS ELECTIVE 3 0 0 9

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ZERRIN IŞIK

Offered to

Computer Engineering (Non-Thesis-Evening) (English)
Computer Engineering Non-Thesis (English)
Computer Engineering (English)
Computer Engineering (English)
COMPUTER ENGINEERING (ENGLISH)

Course Objective

Enable students to understand graph data structure and its algorithms, to apply graph data structures and algorithms to solve the real-life engineering problems.

Learning Outcomes of the Course Unit

1   Define graph data structures and graph algorithms.
2   Analyze graph data structures and algorithms.
3   Identify problems that may benefit from graph representation and its algorithms
4   Apply graph data structure and its algorithms to real-life problems.
5   Relate graph techniques to other engineering problems and to other solution methods; AI, difference equations, machine learning, etc.

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: Kruskal and Prim's Algorithms
5 Shortest Path Algorithms: Dijkstra, Bellman-Ford, Floyd-Warshall
6 Planar Graphs
7 Graph Coloring
8 Maximum Flow Problem
9 Random Walk Method and Applications
10 Graph Centrality Measures
11 Graph Alignment Algorithms
12 Graph Clustering Algorithms
13 Project Presentations
14 Project Presentations

Recomended or Required Reading

Textbook(s): Introduction To Algorithms, Third Edition, THOMAS H. CORMEN CHARLES E. LEISERSON RONALD L. RIVEST CLIFFORD STEIN, The MIT Press, 2009.

Supplementary Book(s):
1. Bondy J.A., Murty U.S.R., Graph Theory, Springer, 2010.
2. Gould R., Graph Theory, The Benjamin-Cummings, 1988.
References:
Materials: Lecture Notes,problem sets.

Planned Learning Activities and Teaching Methods

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 PRJ PROJECT
2 FCG FINAL COURSE GRADE PRJ * 1


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

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Asst. Prof. Dr. Feriştah Dalkılıç
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: +90 (232) 301 74 12
e-posta: feristah@cs.deu.edu.tr

Office Hours

TBA in the first lecture

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 3 39
Preparing presentations 12 2 24
Preparation for quiz etc. 7 1 7
Web Search and Library Research 7 2 14
Project Preparation 4 3 12
Reading 7 3 21
Preparations before/after weekly lectures 13 7 91
Project Assignment 1 6 6
Project Final Presentation 1 5 5
Quiz etc. 7 1 7
TOTAL WORKLOAD (hours) 226

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11
LO.15
LO.25
LO.3545
LO.453544
LO.5355

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS