Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3BLM203Data Structures and Algorithm Analysis2+2+03524.02.2026

 
Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Computer Engineering
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course .
Course Content .
Course Methods and Techniques .
Prerequisites and co-requisities None
Course Coordinator Asist Prof. ÜMİT ÖZTÜRK umit.ozturk@gedik.edu.tr
Name of Lecturers Asist Prof.Dr. BAŞAK BULUZ KÖMEÇOĞLU
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Çölkesen, Rıfat (2013) Veri Yapıları ve Algoritmalar (Papatya Yayıncılık)
Bilgi sistemlerine yapılacak olan yüklemeler
Course Notes .

Course Category
Mathematics and Basic Sciences %30
Engineering %35
Engineering Design %35

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Mid-terms 1 % 30
Quizzes 2 % 10
Assignment 1 % 15
Final examination 1 % 45
Total
5
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 2 28
Hours for off-the-c.r.stud 15 4 60
Mid-terms 1 1 1
Practice 14 2 28
Final examination 1 1 1
Total Work Load   Number of ECTS Credits 5 118

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Students can evaluate time and memory complexities in algorithm analysis.
2 Students can design and implement basic data structures (arrays, linked lists, stacks, queues, trees, graphs, hash tables).
3 Students can develop, compare, and select the appropriate search and ranking algorithms.
4 The student can solve problems using recursion and fundamental algorithm design methods (divide and conquer).
5 Students can grasp advanced topics such as balanced trees, shortest path algorithms, and finite state machines through practical examples.
6 The student can produce solutions to engineering problems by coding knowledge of data structures and algorithms using modern programming languages.

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Introduction to Algorithms
2 Algorithm Analysis
3 Arrays and Linked Lists
4 Stack and Queue Structure
5 Recursion
6 Search Algorithms
7 Sorting Algorithms I
8 Midterm
9 Sorting Algorithms II
10 Tree Data Model I
11 Tree Data Model II
12 Hashing
13 Graph Data Model I
14 Graph Data Model II
15 Finite State Machines

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11
C1 2 4
C2 2 5
C3 3 3
C4 4 4
C5 4 4
C6 5

  bbb

  
  https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=243199&curProgID=5607&lang=en