TÜRKÇE
ENGLISH
Information
| Unit | INSTITUTE OF NATURAL AND APPLIED SCIENCES |
| ELECTRICAL-ELECTRONICS ENGINEERING (PhD) (ENGLISH) | |
| Code | EE725 |
| Name | Grafik Algoritması |
| Term | 2026-2027 Academic Year |
| Term | Fall |
| Duration (T+A) | 3-0 (T-A) (17 Week) |
| ECTS | 6 ECTS |
| National Credit | 3 National Credit |
| Teaching Language | Türkçe |
| Level | Belirsiz |
| Type | Normal |
| Mode of study | Yüz Yüze Öğretim |
| Catalog Information Coordinator | Doç. Dr. FATİH KILIÇ |
| Course Instructor |
The current term course schedule has not been prepared yet.
|
Course Goal / Objective
The aim of this course is to equip students with the fundamental concepts of graph theory and graph algorithms, and to enable them to select, apply, and analyze appropriate algorithms for different graph problems. The course aims to develop students’ ability to solve key problems such as shortest path, minimum spanning tree, maximum flow, and heuristic optimization, and to evaluate the computational complexity of algorithms.
Course Content
Defination and Fundamental graph consepts, Tree, directed graph, undirected graph, Graph Operations, facus on graph algorithm and NP-Hard problems
Course Precondition
There is no prerequisite for the course.
Resources
Keijo Ruohonen, GRAPH THEORY, 2015 Lecture notes
Notes
Chartrand, G., Jordon, H., Vatter, V., & Zhang, P. (2024). Graphs & digraphs. Chapman and Hall/crc.
Course Learning Outcomes
| Order | Course Learning Outcomes |
|---|---|
| LO01 | Applies fundamental mathematical and logical methods used in algorithm analysis. |
| LO02 | Uses graph representations and related data structures. |
| LO03 | Applies fundamental graph algorithms (DFS, BFS, topological sorting). |
| LO04 | Develops algorithms for graph problems and analyzes their performance. |
Relation with Program Learning Outcome
| Order | Type | Program Learning Outcomes | Level |
|---|---|---|---|
| PLO01 | Bilgi - Kuramsal, Olgusal | Being able to specialize in at least one of the branches that form the foundations of Electrical and Electronics Engineering by increasing the level of knowledge beyond the master's level | 4 |
| PLO02 | Bilgi - Kuramsal, Olgusal | To comprehend the integrity of all the subjects included in the field of specialization. | 3 |
| PLO03 | Bilgi - Kuramsal, Olgusal | Having knowledge of the current scientific literature in the field of specialization to analyze the literature critically | 3 |
| PLO04 | Bilgi - Kuramsal, Olgusal | To comprehend the interdisciplinary interaction of the field with other related branches, to suggest similar interactions. | 3 |
| PLO05 | Bilgi - Kuramsal, Olgusal | Ability to do theoretical and experimental work | 3 |
| PLO06 | Bilgi - Kuramsal, Olgusal | To create a complete scientific text by compiling the information obtained from the research | |
| PLO07 | Bilgi - Kuramsal, Olgusal | To work on the thesis topic programmatically, following the logical integrity required by the subject within the framework determined by the advisor. | |
| PLO08 | Bilgi - Kuramsal, Olgusal | To search for literature in scientific databases, particularly the ability to correctly and accurately scan databases and evaluate and categorize listed items. | 3 |
| PLO09 | Bilgi - Kuramsal, Olgusal | Having a command of English and related English jargon at a level that can easily read and understand a scientific text written in English in the field of specialization and write a similar text | |
| PLO10 | Bilgi - Kuramsal, Olgusal | Ability to write a computer program in a familiar programming language, generally for a specific purpose, specifically related to the field of expertise. | 5 |
| PLO11 | Bilgi - Kuramsal, Olgusal | Ability to plan and teach lessons related to the field of specialization or related fields | |
| PLO12 | Bilgi - Kuramsal, Olgusal | Being able to guide and take the initiative in environments that require solving problems related to the field | 4 |
| PLO13 | Yetkinlikler - Bağımsız Çalışabilme ve Sorumluluk Alabilme Yetkinliği | Ability to communicate with people in an appropriate language | |
| PLO14 | Yetkinlikler - Öğrenme Yetkinliği | Adopting the ethical values required by both education and research aspects of academician | |
| PLO15 | Yetkinlikler - Öğrenme Yetkinliği | To be able to produce projects, policies, and processes in the field of expertise and to evaluate these elements | 3 |
| PLO16 | Yetkinlikler - Öğrenme Yetkinliği | Ability to research new topics based on existing research experience | 2 |
Week Plan
| Week | Topic | Preparation | Methods |
|---|---|---|---|
| 1 | Definations and Fundamental Concepts | Review basic graph theory concepts (node, edge, degree). | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 2 | Tree Structures | Study tree structures and their properties. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 3 | Directed Graphs | Learn directed graphs and their applications. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 4 | Matrices and Vector Spaces of Graphs 1 | Study adjacency and incidence matrices. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 5 | Matrices and Vector Spaces of Graphs 2 | Explore relation between graphs and linear algebra. | Öğretim Yöntemleri: Soru-Cevap, Tartışma, Anlatım |
| 6 | Graph Algorithms: Computational Complexity of Algorithms | Review Big-O notation and algorithm analysis. | Öğretim Yöntemleri: Soru-Cevap, Tartışma, Anlatım |
| 7 | Reachability: Warshall’s Algorithm | Study transitive closure concept. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 8 | Mid-Term Exam | Review first 7 weeks. | Ölçme Yöntemleri: Yazılı Sınav |
| 9 | Depth-First and Breadth-First Searches | Study graph search algorithms and data structures. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 10 | The Lightest Path: Dijkstra’s Algorithm | Learn shortest path problem and greedy method. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 11 | The Lightest Spanning Tree: Kruskal’s and Prim’s Algorithms | Study minimum spanning tree concept. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 12 | The Lightest Hamiltonian Circuit (Travelling Salesman’s Problem): The Annealing Algorithm and the Karp–Held Heuristics | Study TSP and heuristic methods. | Öğretim Yöntemleri: Soru-Cevap, Tartışma, Anlatım |
| 13 | Maximum Flow in a Transport Network: The Ford–Fulkerson Algorithm | Study network flow problems. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 14 | Student Presentations | Prepare your presentations. | Ölçme Yöntemleri: Proje / Tasarım, Performans Değerlendirmesi, Sözlü Sınav |
| 15 | Review | Review and compare all algorithms. | Öğretim Yöntemleri: Anlatım, Soru-Cevap, Tartışma |
| 16 | Term Exams | Review all topics. | Ölçme Yöntemleri: Yazılı Sınav |
| 17 | Term Exams | Complete missing topics. | Ölçme Yöntemleri: Yazılı Sınav |
Student Workload - ECTS
| Works | Number | Time (Hour) | Workload (Hour) |
|---|---|---|---|
| Course Related Works | |||
| Class Time (Exam weeks are excluded) | 14 | 3 | 42 |
| Out of Class Study (Preliminary Work, Practice) | 16 | 5 | 80 |
| Assesment Related Works | |||
| Homeworks, Projects, Others | 1 | 24 | 24 |
| Mid-term Exams (Written, Oral, etc.) | 1 | 2 | 2 |
| Final Exam | 1 | 2 | 2 |
| Total Workload (Hour) | 150 | ||
| Total Workload / 25 (h) | 6,00 | ||
| ECTS | 6 ECTS | ||