Yazdır

Ders Tanımı

Ders Kodu Yarıyıl T+U Saat Kredi AKTS
DATA STRUCTURES AND PROGRAMMING BTP 106 2 3 + 0 3 5
Ön Koşul Dersleri
Önerilen Seçmeli Dersler
Dersin Dili Türkçe
Dersin Seviyesi Önlisans
Dersin Türü ZORUNLU
Dersin Koordinatörü Öğr.Gör. SİNAN İLYAS
Dersi Verenler
Dersin Yardımcıları
Dersin Kategorisi
Dersin Amacı
The goal is to make students able to develop software using data structures, by teaching general structures of programming languages.
Dersin İçeriği
General structures of C/C++ programming language, general structures of programming languages, recursive functions, functions, stack structure, queue structure, linked lists, basic sorting and searching algorithms, algorithm analysis, tree structure.
Dersin Öğrenme Çıktıları Öğretim Yöntemleri Ölçme Yöntemleri
1 - To describe general structures of programming languages and use C/C++ programming language 1 - 2 - 3 - 14 - A - C -
2 - To describe data types used in programming languages and use C/C++ programming language 1 - 2 - 3 - 14 - A - C -
3 - To describe basic decisional structures and loops used in programming languages and use C/C++ programming language 1 - 2 - 3 - 14 - A - C -
4 - To describe functions and structure of recursive functions, create recursive functions in programming languages 1 - 2 - 3 - 14 - A - C -
5 - To analyze developed algorithms and compute time complexity 1 - 2 - 3 - 14 - A - C -
Öğretim Yöntemleri: 1:Lecture 2:Question-Answer 3:Discussion 14:Self Study
Ölçme Yöntemleri: A:Testing C:Homework

Ders Akışı

Hafta Konular ÖnHazırlık
1 Introduction to data structures, general structure and properties of C/C++ programming language, use of C/C++ compiler
2 General structure of programming language, basic data types, composite data types, declaration of data type, input-output operations in C/C++
3 Decisional structures (True-False, Multi-select structures) and Loops (while, for loops) in C
4 Subroutines, functions, recursive functions in C/C++
5 Arrays (one-dimensional arrays, multi- dimensional arrays, matrices) in C/C++
6 Standard C Library functions (mathematical functions, termination functions, character operations and data conversion functions)
7 Algorithm analysis, complexity of algorithms, operation time complexity and time complexity, analyze of time complexities
8 Stack structures, add or remove nodes from a stack, example of a stack structure
9 Queue structures, add or remove nodes from a queue, example of a queue structure
10 Linked lists, types of linked lists (Circularly-linked lists, Doubly-linked lists, vs.), algorithmic approach for linked list structure
11 Introduction to sorting algorithms, select and sort algorithms, bubble sort algorithms
12 Insertion sort algorithm, merge sort algorithm
13 Introduction to searching algorithm, linear search algorithm, binary search algorithm
14 Tree structures, tree types

Kaynaklar

Ders Notu
Ders Kaynakları

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

Değerlendirme Sistemi

YARIYIL İÇİ ÇALIŞMALARI SIRA KATKI YÜZDESİ
AraSinav 1 50
KisaSinav 1 15
KisaSinav 2 15
Odev 1 20
Toplam 100
Yıliçinin Başarıya Oranı 20
Finalin Başarıya Oranı 80
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 10 10
Quiz 2 5 10
Assignment 1 5 5
Final examination 1 15 15
Toplam İş Yükü 136
Toplam İş Yükü /25(s) 5.44
Dersin AKTS Kredisi 5.44
; ;