Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3YBS235Data Structures And Algorithm3+0+03621.04.2026

 
Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Management Information Systems
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The aim of this course is to enable students to select the most appropriate data structures and algorithms for a problem given the available constraints, and to evaluate the performance of their solutions without coding.
Course Content In this course, we will focus on basic data structures such as arrays, linked lists, stacks, queues, trees, graphs. In addition, basic algorithms such as searching, sorting, insertion, deletion on these data structures will be covered. In addition, students will be given examples of how data structures and algorithms can be used in real world applications.
This course will partly follow Project Based Learning (PBL). Each student will do a project on a different topic. Students will be assigned projects from a project list. Projects will be done alone.
Course Methods and Techniques EXPRESSION-QUESTION-Answer
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. YUSUF ALİ DANIŞ
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Samet, H. (1990). The design and analysis of spatial data structures (Vol. 85, p. 87). Reading, MA: Addison-wesley.
Tarjan, R. E. (1983). Data structures and network algorithms. Society for industrial and Applied Mathematics.
Course Notes Çobanoğlu, B. (2020). Java ile Programlama ve Veri Yapıları. Pusula Yayıncılık.
Documents 1. Veri Yapıları ve Algoritmalar (Rifat Çölkesen) 2. Algoritmalara Giriş (Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein)

Course Category
Mathematics and Basic Sciences %70
Social Sciences %30

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
Assignment 1 % 10
Project 1 % 15
Final examination 1 % 45
Total
4
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 3 42
Assignments 1 10 10
Mid-terms 1 20 20
Project 1 20 20
Final examination 1 20 20
Total Work Load   Number of ECTS Credits 6 154

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Students will be able to create data structures such as stack, queue, linked list which are taught throughout the course.
2 They can perform operations on balanced trees using the tree data model.
3 They can use graph operations and hashing techniques.
4 Students will be able to use sorting algorithms that can sort the available data in the fastest way so that access is in logarithmic time.
5 They can use search algorithms to find the shortest path to the available data.

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Syllabus discussion, the world of computer software
2 Data Structures and Models, Arrays Identification of projects
3 Arrays
4 Linked Lists
5 Queue Structure Review of projects
6 Stack Structure
7 Tree Applications, Binary Search Trees Delivery of Projects
8 Tree Applications, Binary Search Trees
9 Tree Transition Operations, AVL Trees Determination of assignments
10 Sorting Algorithms
11 Search Algorithms
12 Hash Techniques
13 Graph Data Model
14 Delivery of Homework

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8
All 3 4 5 1 3 1 1 1
C1 3 5 5 1 3 1 1 1
C2 3 5 5 1 3 1 1 1
C3 3 4 3 1 3 1 1 1
C4 2 4 5 1 2 1 1 1
C5 2 4 5 1 2 1 1 1

  bbb

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