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

1-Teaching the concepts of data structures 2-Writing programs in C language using data structures

Course Content

General concepts related to computers, C programming, basic data structures, functions, parameter passing, recursive functions, arrays, system stack, memory layout, multidimensional arrays, struct and union structures, pointers, the relationship between pointers and arrays, dynamic memory usage, linked lists, queue structures, stack structures, tree structures, binary search tree, B-tree, sorting algorithms.

Name of Lecturer(s)
Lec. Rıfat AŞLIYAN
Learning Outcomes
1.Being able to use basic data structures with the C programming language
2.Being able to write all kinds of functions and perform parameter passing
3.Being able to create struct and union structures
4.Being proficient in the concept of pointers
5.Being able to manage computer memory dynamically
6.Being able to design linked list, queue, and stack structures
7.Being able to write code related to tree structures and sorting algorithms
Recommended or Required Reading
1.Veri Yapıları ve Algoritmalar(Data Structures and Algorithms), Dr. Rifat Çölkesen, Papatya Yayıncılık
2.İşte C (Here is C), Rifat Çölkesen, Sistem Yayıncılık
3.The lecture notes will be given to the students
Weekly Detailed Course Contents
Week 1 - Theoretical & Practice
General concepts related to computers
Week 2 - Theoretical & Practice
C programming
Week 3 - Theoretical & Practice
Basic data structures
Week 4 - Theoretical & Practice
Functions, parameter passing, recursive functions
Week 5 - Theoretical & Practice
Arrays, system stack, memory layout, multidimensional arrays
Week 6 - Theoretical & Practice
Struct and union structures
Week 7 - Theoretical & Practice
Dynamic memory usage
Week 8 - Theoretical & Practice
Linked lists (Midterm Exam)
Week 9 - Theoretical & Practice
Queue structures
Week 10 - Theoretical & Practice
Stack structures
Week 11 - Theoretical & Practice
Tree structures
Week 12 - Theoretical & Practice
Binary search tree
Week 13 - Theoretical & Practice
B-tree
Week 14 - Theoretical & Practice
Sorting algorithms
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%40
Final Examination1%60
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory140228
Lecture - Practice140228
Individual Work140342
Midterm Examination118220
Final Examination130232
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
PÇ-16
PÇ-17
PÇ-18
OÇ-1
3
3
4
3
5
4
5
4
OÇ-2
3
4
4
4
5
5
5
5
OÇ-3
4
4
4
5
3
5
5
5
OÇ-4
4
4
4
5
3
5
5
5
OÇ-5
4
4
4
5
3
5
5
5
OÇ-6
4
4
4
5
3
5
5
5
OÇ-7
4
4
4
5
3
5
5
5
Adnan Menderes University - Information Package / Course Catalogue
2026