Yazdır

Ders Tanımı

Ders Kodu Yarıyıl T+U Saat Kredi AKTS
DATA STRUCTURES BSM 207 3 3 + 0 3 6
Ön Koşul Dersleri
Önerilen Seçmeli Dersler
Dersin Dili Türkçe
Dersin Seviyesi Lisans
Dersin Türü ZORUNLU
Dersin Koordinatörü Prof.Dr. NEJAT YUMUŞAK
Dersi Verenler ARAŞTIRMACI (6191) ÜNAL ÇAVUŞOĞLU
Dr.Öğr.Üyesi MUHAMMED FATİH ADAK
Doç.Dr. DEVRİM AKGÜN
Dersin Yardımcıları Res.Asst. M. Fatih ADAK
Dersin Kategorisi
Dersin Amacı
It is aimed to teach the storing information in computer memory and present basic data which is designed for accessing these information.
Dersin İçeriği
Conception of datum and types of datum, lists, Queues, Stacks, Data compression algorithms, Sorting methods, Searching methods, Hash tables
Dersin Öğrenme Çıktıları Öğretim Yöntemleri Ölçme Yöntemleri
1 - Have a knowledge about Data and Basic Data Types. 1 - 2 - 3 - 4 - 15 - A - C - D -
2 - Can compare iterative and recursive solutions. 1 - 2 - 3 - A - C - D -
3 - Have a knowledge of measuring performance of Algorithms. 1 - 2 - 15 - A - C - D -
4 - Can solve problems by using List and Linked List Data Structures. 1 - 2 - A - C -
5 - Can write effective programs by using Stack Data Structures. 1 - 2 - 3 - A - C - D -
6 - Can wirte more efficient programs to todays problems by using Queue Data Structure. 1 - 2 - 3 - 15 - A - C - D -
7 - Can analyse performce of Heap Tree. 1 - 2 - 3 - A - C - D -
8 - Take an advantage of Trees for searching, sorting and special issues. 1 - 2 - 4 - A - C - D -
9 - Have a knowledge about application areas of Binary Trees. 1 - 2 - 4 - A - C - D -
10 - Have a knowledge of Balanced and Unbalanced Trees. 1 - 2 - 4 - A - C - D -
11 - Can use Red Black Trees in applications and problem solving. 1 - 2 - 4 - A - C - D -
12 - Have a knowledge of advantages of B Trees. 1 - 2 - 4 - A - C - D -
13 - Can use B, Red Black and AVL Trees in applicaitons and problem solving. 1 - 2 - 4 - A - C - D -
14 - Have a knowledge of Hash table applications. 1 - 4 - A - C -
15 - Student can define a new Data Structure by himself. 1 - D -
Öğretim Yöntemleri: 1:Lecture 2:Question-Answer 3:Discussion 4:Drilland Practice 15:Problem Solving
Ölçme Yöntemleri: A:Testing C:Homework D:Project / Design

Ders Akışı

Hafta Konular ÖnHazırlık
1 Basic data type, data concept and algorithm analysis
2 Recursion concept and recursive algorithms
3 Lists and static and dynamic arrays
4 Linked Lists, single linked list, double linked lists, circular lists
5 Stacks and its applications
6 Queues and its applications
7 Priority queue and heap tree
8 Trees and its applications
9 Binary trees, binary search tree and its applications
10 AVL Trees
11 Red Black Trees
12 B Trees
13 Tree data structure applications
14 Hash tables

Kaynaklar

Ders Notu 1. Prof. Dr. Nejat YUMUŞAK, M. Fatih ADAK, "C/C++ ile Veri Yapıları ve Çözümlü Uygulamalar", Seçkin yayıncılık, 2014
Ders Kaynakları 1. Prof. Dr. Nejat YUMUŞAK, M. Fatih ADAK, "C/C++ ile Veri Yapıları ve Çözümlü Uygulamalar", Seçkin yayıncılık, 2014.

2. Dr.Rifat ÇÖLKESEN, "Veri yapıları ve algoritmalar", Papatya yayıncılık, 2002.
3. İbrahim Akman, "C ile Veri yapıları", SAS bilişim yayınları, 2002.

Döküman Paylaşımı


Dersin Program Çıktılarına Katkısı

No Program Öğrenme Çıktıları KatkıDüzeyi
1 2 3 4 5
1 To have sufficient foundations on engineering subjects such as science and discrete mathematics, probability/statistics; an ability to use theoretical and applied knowledge of these subjects together for engineering solutions, X
2 An ability to determine, describe, formulate and solve engineering problems; for this purpose, an ability to select and apply proper analytic and modeling methods,al background in describing, formulating, modeling and analyzing the engineering problem, with a consideration for appropriate analytical solutions in all necessary situations X
3 An ability to select and use modern techniques and tools for engineering applications; an ability to use information technologies efficiently, X
4 An ability to analyze a system, a component or a process and design a system under real limits to meet desired needs; in this direction, an ability to apply modern design methods, X
5 An ability to design, conduct experiment, collect data, analyze and comment on the results and consciousness of becoming a volunteer on research,
6 Understanding, awareness of administration, control, development and security/reliability issues about information technologies,
7 An ability to work efficiently in multidisciplinary teams, self confidence to take responsibility,
8 An ability to present himself/herself or a problem with oral/written techniques and have efficient communication skills; know at least one extra language,
9 An awareness about importance of lifelong learning; an ability to update his/her knowledge continuously by means of following advances in science and technology,
10 Understanding, practicing of professional and ethical responsibilities, an ability to disseminate this responsibility on society,
11 An understanding of project management, workplace applications, health issues of laborers, environment and job safety; an awareness about legal consequences of engineering applications,
12 An understanding universal and local effects of engineering solutions; awareness of entrepreneurial and innovation and to have knowledge about contemporary problems.

Değerlendirme Sistemi

YARIYIL İÇİ ÇALIŞMALARI SIRA KATKI YÜZDESİ
AraSinav 1 45
Odev 1 15
Odev 2 20
Odev 3 20
Toplam 100
Yıliçinin Başarıya Oranı 50
Finalin Başarıya Oranı 50
Toplam 100

AKTS - İş Yükü

Etkinlik Sayısı Süresi(Saat) Toplam İş yükü(Saat)
Course Duration (Including the exam week: 16x Total course hours) 16 3 48
Hours for off-the-classroom study (Pre-study, practice) 16 3 48
Mid-terms 1 12 12
Assignment 3 4 12
Performance Task (Application) 1 4 4
Final examination 1 16 16
Toplam İş Yükü 140
Toplam İş Yükü /25(s) 5.6
Dersin AKTS Kredisi 5.6
; ;