| Ders Adı | Kodu | Yarıyıl | T+U Saat | Kredi | AKTS |
|---|---|---|---|---|---|
| Data Structures | ISE 203 | 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ü | Dr.Öğr.Üyesi FATMA AKALIN |
| Dersi Verenler | Dr.Öğr.Üyesi CAN YÜZKOLLAR, |
| Dersin Yardımcıları | |
| Dersin Kategorisi | Diğer |
| Dersin Amacı | After preparing algorithm/flowchart, determination of data structures is necessary in computer programming. This course covers the basic data structures. |
| Dersin İçeriği | Conception of datum and types of datum, lists, Queues, Stacks, Data compression algorithms, Sorting methods, Searching methods, Hash tables |
| # | Ders Öğrenme Çıktıları | Öğretim Yöntemleri | Ölçme Yöntemleri |
|---|---|---|---|
| 1 | Designing data structures | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| 2 | Determining appropriate data structures | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| 3 | Comparing algorithms | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| 4 | Data abstraction ability | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| 5 | Make more effective programming | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| 6 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 7 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 8 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 9 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 10 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 11 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 12 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 13 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 14 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, | |
| 15 | Lecture, Question-Answer, Drilland Practice, | Testing, Homework, |
| Hafta | Ders Konuları | Ön Hazırlık |
|---|---|---|
| 1 | Basic data type and data concept | |
| 2 | Recursion | |
| 3 | Lists and its applications | |
| 4 | Linked Lists, double linked lists | |
| 5 | Stacks and its applications | |
| 6 | Queues and its applications | |
| 7 | Priority queue and heap tree | |
| 8 | Trees and its applications | |
| 9 | Binary search tree and its applications | |
| 10 | Data compression algorithms | |
| 11 | Sorting methods (Insertion, Selection, Bubble) | |
| 12 | Sorting methods (Merge, Quick, Heap) | |
| 13 | Searching methods | |
| 14 | Hash tables |
| Kaynaklar | |
|---|---|
| Ders Notu | Course notes |
| Ders Kaynakları | 1. Dr.Rifat ÇÖLKESEN, "Veri yapıları ve algoritmalar", Papatya yayıncılık, 2002. 2. İbrahim Akman, "C ile Veri yapıları", SAS bilişim yayınları, 2002. |
| Sıra | Program Çıktıları | Katkı Düzeyi | |||||
|---|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | X | ||||||
| 2 | X | ||||||
| 3 | X | ||||||
| 4 | X | ||||||
| 5 | X | ||||||
| 6 | |||||||
| 7 | X | ||||||
| 8 | X | ||||||
| 9 | X | ||||||
| 10 | |||||||
| 11 | X | ||||||
| 12 | X | ||||||
| Değerlendirme Sistemi | |
|---|---|
| Yarıyıl Çalışmaları | Katkı Oranı |
| 1. Ara Sınav | 50 |
| 1. Ödev | 15 |
| 2. Ödev | 15 |
| 3. Ödev | 20 |
| Toplam | 100 |
| 1. Yıl İçinin Başarıya | 50 |
| 1. Final | 50 |
| Toplam | 100 |
| AKTS - İş Yükü Etkinlik | Sayı | Süre (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 | 7 | 7 |
| Quiz | 2 | 8 | 16 |
| Assignment | 1 | 8 | 8 |
| Final examination | 1 | 12 | 12 |
| Toplam İş Yükü | 139 | ||
| Toplam İş Yükü / 25 (Saat) | 5,56 | ||
| Dersin AKTS Kredisi | 6 | ||