Information Package / Course Catalogue
Data Structures and Algorithms
Course Code: YBS205
Course Type: Required
Couse Group: First Cycle (Bachelor's Degree)
Education Language: Turkish
Work Placement: N/A
Theory: 3
Prt.: 0
Credit: 3
Lab: 0
ECTS: 6
Objectives of the Course

The aim of the course is to teach students good principles of algorithm design and data structures

Course Content

In this course, Introduction to Software Design, Introduction to Analysis of Algorithms, Sequential Containers, Stack, Queue, recursive calls it, Trees, Stacks, hash coding, Map and Set, Graphs, balanced trees, Placement

Name of Lecturer(s)
Prof. Muhsin ÖZDEMİR
Learning Outcomes
1.design correct and eficient algorithm
2.analyze algorithms and estimate their worst-case and average-case behaviour (in easy cases)
3.decide which data structure is more appropriate to solve a specific application
4.Data types and linked lists
5.Stack, tail and tree structures
Recommended or Required Reading
1.1. M. A. Weiss, Data Structures and Algorithm Analysis in C++, Addison Wesley, 2006
2.2. Cormen, Leiserton, Rivest, Introduction to Algorithms, MIT Press, 2001
3.3. Sahni, Data Structures, Algorithms and Applications in C++, McGraw-Hill, 1998.
4.4. Horowitz, Sahni, Rajasekaran, Computer Algorithms, Computer Science Press, 1998.
5.5. Rifat Çölkesen, Veri Yapıları ve Algoritmalar, Papatya Yayıncılık 2002.
Weekly Detailed Course Contents
Week 1 - Theoretical
Fundamentals of Algorithmic Problem Solving
Week 1 - Preparation Work
Course Material
Week 2 - Theoretical
Fundamentals of the Analysis of Algorithm Efficiency
Week 2 - Preparation Work
Course Material
Week 3 - Theoretical
Queues and Stacks
Week 3 - Preparation Work
Course Material
Week 4 - Theoretical
Lists and Linked Lists
Week 4 - Preparation Work
Course Material
Week 5 - Theoretical
Tree Structures
Week 5 - Preparation Work
Course Material
Week 6 - Theoretical
Divide and Conquer
Week 6 - Preparation Work
Course Material
Week 7 - Theoretical
Search Algorithms, String Search Algorithms
Week 7 - Preparation Work
Course Material
Week 8 - Theoretical
Sorting Algorithms - 1
Week 8 - Preparation Work
Course Material
Week 9 - Theoretical
Graph Algorithms (Shortest Path, Critical Path)
Week 10 - Theoretical
Graph Algorithms (Shortest Path, Critical Path)
Week 11 - Theoretical
Graph Algorithms ( Minimum Spanning Tree, Maximum Flow)
Week 11 - Preparation Work
Course Material
Week 12 - Theoretical
Graph Algorithms ( Minimum Spanning Tree, Maximum Flow)
Week 12 - Preparation Work
Course Material
Week 13 - Theoretical
Geometric Algorithms
Week 13 - Preparation Work
Course Material
Week 14 - Theoretical
Recurrence Relations
Week 14 - Preparation Work
Course Material
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%40
Final Examination1%60
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory132365
Assignment132026
Individual Work132026
Quiz1819
Midterm Examination19110
Final Examination113114
TOTAL WORKLOAD (hours)150
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
PÇ-12
PÇ-13
PÇ-14
PÇ-15
OÇ-1
4
5
4
OÇ-2
5
4
5
OÇ-3
4
5
5
OÇ-4
OÇ-5
Adnan Menderes University - Information Package / Course Catalogue
2026