Lesson plan / DATA STRUCTURES

Lesson Information

Course Credit 3.0
Course ECTS Credit 6.0
Teaching Language of Instruction Türkçe
Level of Course Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course Compulsory
Mode of Delivery Face-to-face
Does the course require compulsory or optional work experience? Z
Course Coordinator Prof. Dr. MİNE ERGÜVEN
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course Teaching the storage of datas at the computer memory and basic data structures designed for the access to stored data.
Course Content Data concepts and data types, lists, linked lists; queue, stack, binary trees and their applications, compression algorithms, sorting algorithms and their comparison, search algorithms and their comparison and hash tables.

Weekly Course Subjects

1Data concept and Basic data types
2Recursion
3List data structures and applications
4Linked list, lists with two-way , one-way linked lists
5The stack data structure and their applications
6The queue data structures and their applications
7The priority queue and Heap tree
8Midterm exam
9Tree data structures and their applications
10Binary search trees and their applications
11Data Compression Algorithms
12Ranking methods (Insertion, Selection, Bubble, Merge, Quick, Heap, Radix Sort)
13Search Methods
14Hash tables

Resources

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