COURSE CONTENT Academic Unit : Faculty of Engineering

COURSE CONTENT Academic Unit : Faculty of Engineering

BĐLECĐK ŞEYH EDEBALĐ UNIVERSITY
FACULTY OF ENGINEERING
DEPARTMENT OF COMPUTER ENGINEERING
PROGRAM OF UNDERGRADUATE
Academic Unit
COURSE CONTENT
: Faculty of Engineering
Department / Program
: Computer Engineering
Turkish Course Title
: Veri Yapıları ve Algoritmalar
English Course Title
: Data Structure and Algorithms
L+U Hour
: 2+2
Semester
: 4
Credits / ECTS
: 3/6
Language of Instruction
: Turkish
Course Type (Compulsory/Elective)
: Compulsory
WEEKLY COURSE CURRICULUM
Subjects
Week
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Goals
Turkish
Content
English
Content
Introduction, Basic Concepts
Data Models: Basic Definitions and properties
Data structures: Basic data structures
Data structures with definitions: (struct, union)
Search and Sorting Algorithms: Introduction, basic definitions, Search Algorithms (sequential, binary, hash),
Sorting Algorithms (Insertion)
Sorting algorithms (insertion, selection, bubble, merge, heap, quick)
Linked List Data Model: Concepts, pointer variables, Linked list data structure, definition/declaration with code
Linked List Application / One-Way: Add, list, search, delete,
Linked List on array/ One way: Inserting, Listing, Searching, Writing to file, Creating list from file
Two-Way Linked List Application: Add, list, search, delete;
Queue and Stack Structures: Queue and Stack transactions, Sliding Queue on Array (Add/Delete), Cyclic Queue
on array, Queue with linked list, Design of stack on array, Stack design with linked list
Tree Data Model: Basic concepts and terms, Tree types, Tree transactions, Holding trees on memory and data
structure
Graph Data Model: Binary search tree (list, insert, search, delete)
Graph Data Model: Basic concepts and terms, Keeping Graphs on the memory, Graph coloring, Graph
algorithms, Greedy approach
The goals of this course are storing numeric and alphanumeric information in computer memory and teaching
basic designed data structures and data models to access to these information and applying of them with C
programming language.
Temel Kavramlar: Yazılım ve Program, Program kodu, Donanım ve Bellek, Đşletim Sistemi, Veri Yapısı ve Veri
Modeli, Algoritma ve Heuristic Yaklaşımlar, Kaba (pseudo) kod ve Gerçek kod, Program karmaşıklığı, Büyük O
notasyonu; Temel Veri Modelleri; Veri Yapıları: Veri yapısı nedir?, Temel veri yapıları, Tanımlamalı veri
yapıları; Arama ve Sıralama Algoritmaları: Arama algoritmaları (Ardışıl arama, Đkili arama), Sıralama
Algoritmaları (Araya sokma, Seçmeli, Kabarcık, Birleşmeli, Kümeleme, Hızlı); Liste ve Bağlantılı Liste Veri
Modeli; Kuyruk ve Yığın Yapısı; Ağaç Veri Modeli; Graf Veri modeli
Basic Concepts: Software and program, program code, hardware and memory, operating System, data structure
and data model, algorithm and heuristic approaches, pseudo and real code, complexity of a program, big O
notation; Basic Data Models; Data Structures: Data structure definition, the basic data structures, descriptive
data structures; Search and Sorting Algorithms: Search algorithms (sequential search, binary search), sorting
algorithms (insertion, selection, bubble, merge, heap, quick); List and Linked List Data Model; Queue and Stack
Structures; Tree Data Model; Graph Data Model
References
1) Dr. Rıfat Çölkesen, Algoritma Geliştirme ve Veri Yapıları, Papatya Press, 1. edition, 2009, ISBN 978-975-6797-945.